With the development of Service-Oriented Technologies, the amount of Web services grows rapidly. Situation awareness, as a very important computing paradigm which can provide more reasonable and complete representation of the user's environment, can be benefit to the discovering of the service user's requirement. Therefore in this paper, we explore to use the situational information to recommend services which satisfy the requirement of users better and meanwhile improve the QoS prediction accuracy. Both the convergences between users' service selections in different situations and their QoS experiences have been taken into account. Moreover, we investigate the potential relationships between the situations structure and the services selection. Experiment results indicate that our method achieves ideal performance.
{"title":"A Web Service Recommendation Approach Based on Situation Awareness","authors":"Chen Liu, Huiping Lin, Yibing Xiong","doi":"10.1109/SCC.2013.103","DOIUrl":"https://doi.org/10.1109/SCC.2013.103","url":null,"abstract":"With the development of Service-Oriented Technologies, the amount of Web services grows rapidly. Situation awareness, as a very important computing paradigm which can provide more reasonable and complete representation of the user's environment, can be benefit to the discovering of the service user's requirement. Therefore in this paper, we explore to use the situational information to recommend services which satisfy the requirement of users better and meanwhile improve the QoS prediction accuracy. Both the convergences between users' service selections in different situations and their QoS experiences have been taken into account. Moreover, we investigate the potential relationships between the situations structure and the services selection. Experiment results indicate that our method achieves ideal performance.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130470679","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}
Weiwei Qiu, Zibin Zheng, Xinyu Wang, Xiaohu Yang, Michael R. Lyu
QoS value prediction of Web services is an important research issue for service recommendation, selection and composition. Collaborative Filtering (CF) is one of the most widely used methods which employs QoS values contributed by similar users to make predictions. Therefore, historical QoS values contributed by different users can have great impacts on prediction results. However, existing Web service QoS value prediction approaches did not take data credibility into consideration, which may impact the prediction accuracy. To address this problem, we propose a reputation-aware QoS value prediction approach, which first calculates the reputation of each user based on their contributed values, and then takes advantage of reputation-based ranking to exclude the values contributed by untrustworthy users. CF QoS prediction approach is finally used to predict the missing QoS values based on the purified dataset. Experimental results show that our approach has higher prediction accuracy than other approaches.
{"title":"Reputation-Aware QoS Value Prediction of Web Services","authors":"Weiwei Qiu, Zibin Zheng, Xinyu Wang, Xiaohu Yang, Michael R. Lyu","doi":"10.1109/SCC.2013.43","DOIUrl":"https://doi.org/10.1109/SCC.2013.43","url":null,"abstract":"QoS value prediction of Web services is an important research issue for service recommendation, selection and composition. Collaborative Filtering (CF) is one of the most widely used methods which employs QoS values contributed by similar users to make predictions. Therefore, historical QoS values contributed by different users can have great impacts on prediction results. However, existing Web service QoS value prediction approaches did not take data credibility into consideration, which may impact the prediction accuracy. To address this problem, we propose a reputation-aware QoS value prediction approach, which first calculates the reputation of each user based on their contributed values, and then takes advantage of reputation-based ranking to exclude the values contributed by untrustworthy users. CF QoS prediction approach is finally used to predict the missing QoS values based on the purified dataset. Experimental results show that our approach has higher prediction accuracy than other approaches.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"13 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131437292","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}
Specifying and analysing non-functional properties (NFPs) is essential for driving architectural decisions and validating composite service designs. Only where NFPs have been specified can we choose between services with similar functionality that would better satisfy our non-functional requirements. Meanwhile, incorporating provenance functionality into service-oriented systems' design is becoming crucial for users, allowing them to query the generation methods and origins of the data the system outputs. This need is particularly evident in compositions of services, where audits of individual services do not provide a connected picture of the composition's processing history. Making provenance awareness (ability to answer provenance queries) an explicit NFP in composite service specifications would enable composite service designers to analyse whether they meet provenance-related requirements. In this paper, we discuss a framework for designing and analysing provenance awareness for service compositions. We envision this as a basis for analysing the impact of provenance on other NFPs such as performance and storage.
{"title":"Towards Provenance Aware Design of Service Compositions: A Methodology for Analysing the Provenance Awareness in Service Designs","authors":"Paraskevi Zerva, S. Zschaler, S. Miles","doi":"10.1109/SCC.2013.17","DOIUrl":"https://doi.org/10.1109/SCC.2013.17","url":null,"abstract":"Specifying and analysing non-functional properties (NFPs) is essential for driving architectural decisions and validating composite service designs. Only where NFPs have been specified can we choose between services with similar functionality that would better satisfy our non-functional requirements. Meanwhile, incorporating provenance functionality into service-oriented systems' design is becoming crucial for users, allowing them to query the generation methods and origins of the data the system outputs. This need is particularly evident in compositions of services, where audits of individual services do not provide a connected picture of the composition's processing history. Making provenance awareness (ability to answer provenance queries) an explicit NFP in composite service specifications would enable composite service designers to analyse whether they meet provenance-related requirements. In this paper, we discuss a framework for designing and analysing provenance awareness for service compositions. We envision this as a basis for analysing the impact of provenance on other NFPs such as performance and storage.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124930223","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}
XML syntax and semantic validations are critical to the correct service transaction specification and service integration based on existing distributed and heterogeneous computing services. This research proves that the current industry practice of XSLT-based Schematron validation may produce invalid results, and contributes a reusable XML validator component that supports sound integrated syntax/semantic validations and event-driven integration with its environment through public APIs.
{"title":"Integrated Syntax and Semantic Validation for Services Computing","authors":"Lixin Tao, S. Golikov","doi":"10.1109/SCC.2013.71","DOIUrl":"https://doi.org/10.1109/SCC.2013.71","url":null,"abstract":"XML syntax and semantic validations are critical to the correct service transaction specification and service integration based on existing distributed and heterogeneous computing services. This research proves that the current industry practice of XSLT-based Schematron validation may produce invalid results, and contributes a reusable XML validator component that supports sound integrated syntax/semantic validations and event-driven integration with its environment through public APIs.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114547319","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}
P. Townend, V. Viduto, D. Webster, K. Djemame, L. Lau, V. Dimitrova, Jie Xu, S. Fores, Charlie Dibsdale, J. Austin, John McAvoy, Stephen Hobson
Service-orientation is effective at managing complexity and dynamicity at a programmatic level, but there is still much work to be done in understanding and improving the trust that users place in a system's outputs, and the extent to which they understand the associated risks of decisions recommended by a system. This is crucial if we are to improve the uptake and real-world effectiveness of service-based decision-support systems whilst also reducing the risks (both perceived and actual) of using such systems. This paper presents the current progress of the STRAPP project, which is designing and engineering novel trust and risk assessment mechanisms for services computing and applying these to a number of real-world service-based decision-support systems. A new layered architecture model for trust and risk is introduced and described in detail, and we present our state-of-the-art work in risk-assessment, demonstrating the relationship between provenance data and risk via a mathematical model. We then give a detailed description of our latest software demonstrator, integrated into the Rolls-Royce Equipment Health Management system, and comprehensively discuss the lessons we have learnt from developing such a complex, holistic, and applied real-world system. Finally, we describe the future work we plan to complete.
{"title":"Risk Assessment and Trust in Services Computing: Applications and Experience","authors":"P. Townend, V. Viduto, D. Webster, K. Djemame, L. Lau, V. Dimitrova, Jie Xu, S. Fores, Charlie Dibsdale, J. Austin, John McAvoy, Stephen Hobson","doi":"10.1109/SCC.2013.41","DOIUrl":"https://doi.org/10.1109/SCC.2013.41","url":null,"abstract":"Service-orientation is effective at managing complexity and dynamicity at a programmatic level, but there is still much work to be done in understanding and improving the trust that users place in a system's outputs, and the extent to which they understand the associated risks of decisions recommended by a system. This is crucial if we are to improve the uptake and real-world effectiveness of service-based decision-support systems whilst also reducing the risks (both perceived and actual) of using such systems. This paper presents the current progress of the STRAPP project, which is designing and engineering novel trust and risk assessment mechanisms for services computing and applying these to a number of real-world service-based decision-support systems. A new layered architecture model for trust and risk is introduced and described in detail, and we present our state-of-the-art work in risk-assessment, demonstrating the relationship between provenance data and risk via a mathematical model. We then give a detailed description of our latest software demonstrator, integrated into the Rolls-Royce Equipment Health Management system, and comprehensively discuss the lessons we have learnt from developing such a complex, holistic, and applied real-world system. Finally, we describe the future work we plan to complete.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121863156","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}
This paper describes a provenance-based access control system for the cloud. The system combines both provenance and access-control models together with a rule-based mechanism. The system allows rule propagation (in the cloud) and a central execution engine for enforcing security and trustworthiness.
{"title":"Provenance-Based Access Control in the Cloud","authors":"Julien Lacroix, Omar Boucelma","doi":"10.1109/SCC.2013.51","DOIUrl":"https://doi.org/10.1109/SCC.2013.51","url":null,"abstract":"This paper describes a provenance-based access control system for the cloud. The system combines both provenance and access-control models together with a rule-based mechanism. The system allows rule propagation (in the cloud) and a central execution engine for enforcing security and trustworthiness.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122793631","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}
On-demand resource provisioning is with great challenge in cloud systems. The key problem is how to learn about the future workload in advance to help determine resource allocation. There are various prediction models developed to predict the future workload. The major problem of previous researches is that they assume that application workload has static pattern. In practice, so many application workloads have hybrid dynamic pattern overtime. To achieve high prediction accuracy, we find that it's essential to detect both workload pattern stage and the changes in the model parameters. In this paper, we present a Pattern Sensitive Resource Provisioning Scheme, named PSRPS. It can recognize application workload patterns and choose suitable prediction models for prediction online. Besides, when there is maladjustment in prediction models, PSRPS can switch prediction models or adjust the parameters of the model by itself to adaptively to guarantee prediction accuracy.
{"title":"PSRPS: A Workload Pattern Sensitive Resource Provisioning Scheme for Cloud Systems","authors":"Feifei Zhang, Jie Wu, Zhihui Lu","doi":"10.1109/SCC.2013.49","DOIUrl":"https://doi.org/10.1109/SCC.2013.49","url":null,"abstract":"On-demand resource provisioning is with great challenge in cloud systems. The key problem is how to learn about the future workload in advance to help determine resource allocation. There are various prediction models developed to predict the future workload. The major problem of previous researches is that they assume that application workload has static pattern. In practice, so many application workloads have hybrid dynamic pattern overtime. To achieve high prediction accuracy, we find that it's essential to detect both workload pattern stage and the changes in the model parameters. In this paper, we present a Pattern Sensitive Resource Provisioning Scheme, named PSRPS. It can recognize application workload patterns and choose suitable prediction models for prediction online. Besides, when there is maladjustment in prediction models, PSRPS can switch prediction models or adjust the parameters of the model by itself to adaptively to guarantee prediction accuracy.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126768687","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}
Cloud storage systems have received extensive attention in recent years. Many individuals and business organizations are beginning to move their data to cloud environments. It becomes increasingly important to investigate secure file storage in cloud environments. In this paper, we present a secure distributed file distribution system in which the customers can directly choose appropriate design parameters and service providers. In our scheme, we use novel coding techniques that almost achieve the Shannon information bound with very efficient coding and decoding process. Our evaluations show the correctness and efficiency of the coding scheme. We show that the problem to find the satisfying file distribution under certain cost and security constraints is NP-hard, and present the Satisfiability Modulo Theories (SMT) formalization to find the satisfying data share distribution with cost and security constraints. The SMT formalization is flexible to be applied to other threshold based cloud file distribution system and can accommodate other constraints. We also analyse the security of the scheme by defining the security metric (compromising probability) for both the eavesdropping and DoS attackers and show that one must carefully choose design parameters to achieve the required security.
{"title":"Private and Anonymous Data Storage and Distribution in Cloud","authors":"Qi Duan, Yongge Wang, Fadi Mohsen, E. Al-Shaer","doi":"10.1109/SCC.2013.53","DOIUrl":"https://doi.org/10.1109/SCC.2013.53","url":null,"abstract":"Cloud storage systems have received extensive attention in recent years. Many individuals and business organizations are beginning to move their data to cloud environments. It becomes increasingly important to investigate secure file storage in cloud environments. In this paper, we present a secure distributed file distribution system in which the customers can directly choose appropriate design parameters and service providers. In our scheme, we use novel coding techniques that almost achieve the Shannon information bound with very efficient coding and decoding process. Our evaluations show the correctness and efficiency of the coding scheme. We show that the problem to find the satisfying file distribution under certain cost and security constraints is NP-hard, and present the Satisfiability Modulo Theories (SMT) formalization to find the satisfying data share distribution with cost and security constraints. The SMT formalization is flexible to be applied to other threshold based cloud file distribution system and can accommodate other constraints. We also analyse the security of the scheme by defining the security metric (compromising probability) for both the eavesdropping and DoS attackers and show that one must carefully choose design parameters to achieve the required security.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127228838","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}
Junhee Park, Qingyang Wang, D. Jayasinghe, Jack Li, Yasuhiko Kanemasa, Masazumi Matsubara, Daisaku Yokoyama, M. Kitsuregawa, C. Pu
The prevalence of multi-core processors has raised the question of whether applications can use the increasing number of cores efficiently in order to provide predictable quality of service (QoS). In this paper, we study the horizontal scalability of n-tier application performance within a multicore processor (MCP). Through extensive measurements of the RUBBoS benchmark, we found one major source of performance variations within MCP: the mapping of cores to virtual CPUs can significantly lower on-chip cache hit ratio, causing performance drops of up to 22% without obvious changes in resource utilization. After we eliminated these variations by fixing the MCP core mapping, we measured the impact of three mainstream hypervisors (the dominant Commercial Hypervisor, Xen, and KVM) on intra-MCP horizontal scalability. On a quad-core dual-processor (total 8 cores), we found some interesting similarities and dissimilarities among the hypervisors. An example of similarities is a non-monotonic scalability trend (throughput increasing up to 4 cores and then decreasing for more than 4 cores) when running a browse-only CPU-intensive workload. This problem can be traced to the management of last level cache of CPU packages. An example of dissimilarities among hypervisors is their handling of write operations in mixed read/write, I/O-intensive workloads. Specifically, the Commercial Hypervisor is able to provide more than twice the throughput compared to KVM. Our measurements show that both MCP cache architecture and the choice of hypervisors indeed have an impact on the efficiency and horizontal scalability achievable by applications. However, despite their differences, all three mainstream hypervisors have difficulties with the intra-MCP horizontal scalability beyond 4 cores for n-tier applications.
{"title":"Variations in Performance Measurements of Multi-core Processors: A Study of n-Tier Applications","authors":"Junhee Park, Qingyang Wang, D. Jayasinghe, Jack Li, Yasuhiko Kanemasa, Masazumi Matsubara, Daisaku Yokoyama, M. Kitsuregawa, C. Pu","doi":"10.1109/SCC.2013.116","DOIUrl":"https://doi.org/10.1109/SCC.2013.116","url":null,"abstract":"The prevalence of multi-core processors has raised the question of whether applications can use the increasing number of cores efficiently in order to provide predictable quality of service (QoS). In this paper, we study the horizontal scalability of n-tier application performance within a multicore processor (MCP). Through extensive measurements of the RUBBoS benchmark, we found one major source of performance variations within MCP: the mapping of cores to virtual CPUs can significantly lower on-chip cache hit ratio, causing performance drops of up to 22% without obvious changes in resource utilization. After we eliminated these variations by fixing the MCP core mapping, we measured the impact of three mainstream hypervisors (the dominant Commercial Hypervisor, Xen, and KVM) on intra-MCP horizontal scalability. On a quad-core dual-processor (total 8 cores), we found some interesting similarities and dissimilarities among the hypervisors. An example of similarities is a non-monotonic scalability trend (throughput increasing up to 4 cores and then decreasing for more than 4 cores) when running a browse-only CPU-intensive workload. This problem can be traced to the management of last level cache of CPU packages. An example of dissimilarities among hypervisors is their handling of write operations in mixed read/write, I/O-intensive workloads. Specifically, the Commercial Hypervisor is able to provide more than twice the throughput compared to KVM. Our measurements show that both MCP cache architecture and the choice of hypervisors indeed have an impact on the efficiency and horizontal scalability achievable by applications. However, despite their differences, all three mainstream hypervisors have difficulties with the intra-MCP horizontal scalability beyond 4 cores for n-tier applications.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123439536","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}
Wuhui Chen, Incheon Paik, Takazumi Tanaka, B. Kumara
With increasing presence and adoption of Web Services on the World Wide Web, to recommend suitable services to users has become an important issue. However, existing personalization approaches, such as collaborative filtering or content based recommendations, are ignoring services' sociability because of the isolation of services without social relationships among them, and lacking of consideration of social influence. Therefore, there is a need for more accurate means to interlink them in a social-enhanced interest network, and to analyze and quantify the social influence. In this paper, we propose a methodology to connect distributed services into a global social service network for social influence-aware service recommendation, called recommend-as-you-go. First, we propose a novel platform to construct a global social service network by linking distributed services with social link using quality of social link, and then we propose a flexible model for effective awareness of social influence to provide a quantitative measure of the influential strength, Next, a novel social influence-aware service recommendation approach is presented based on global social service network, and finally, the experiment results show that our new approach can solve the quality of service recommendation problem well with quick query response, low usage threshold and high accuracy with user preferences by recommend-as-you-go.
{"title":"Awareness of Social Influence for Service Recommendation","authors":"Wuhui Chen, Incheon Paik, Takazumi Tanaka, B. Kumara","doi":"10.1109/SCC.2013.95","DOIUrl":"https://doi.org/10.1109/SCC.2013.95","url":null,"abstract":"With increasing presence and adoption of Web Services on the World Wide Web, to recommend suitable services to users has become an important issue. However, existing personalization approaches, such as collaborative filtering or content based recommendations, are ignoring services' sociability because of the isolation of services without social relationships among them, and lacking of consideration of social influence. Therefore, there is a need for more accurate means to interlink them in a social-enhanced interest network, and to analyze and quantify the social influence. In this paper, we propose a methodology to connect distributed services into a global social service network for social influence-aware service recommendation, called recommend-as-you-go. First, we propose a novel platform to construct a global social service network by linking distributed services with social link using quality of social link, and then we propose a flexible model for effective awareness of social influence to provide a quantitative measure of the influential strength, Next, a novel social influence-aware service recommendation approach is presented based on global social service network, and finally, the experiment results show that our new approach can solve the quality of service recommendation problem well with quick query response, low usage threshold and high accuracy with user preferences by recommend-as-you-go.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130881298","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
扫码关注我们
求助内容：
应助结果提醒方式：