Carpooling increases the occupancy rate of cars by decreasing the number of empty seats, thereby creating an effective solution to traffic congestion. This paper proposes an intelligent carpool system, BlueNet, which comprises two important modules. These modules are called the Mobile Client module and the Cloud Global Carpool Services module. By using smart handheld devices, users can submit carpool requests and obtain matches within the Mobile Client module via the Cloud Global Carpool Services module. The Cloud Global Carpool Services module generates acceptable matches via the Genetic-based Carpool Route and Matching algorithm. The proposed algorithm furthers the solution to the carpool service problem by dramatically reducing the time required to match a large number of users. In regard to the quality of the matches and processing time, the experimental results show that the proposed Genetic-based Carpool Route and Matching algorithm is able to find carpool route and matching results that are among the most optimal, and operates with significantly less computational complexity to require less services computing time.
拼车通过减少空座位数量来提高汽车的入住率，从而有效地解决了交通拥堵问题。本文提出了一种智能拼车系统BlueNet，该系统包括两个重要模块。这些模块被称为移动客户端模块和云全球拼车服务模块。通过使用智能手持设备，用户可以通过Cloud Global carpool Services模块在移动客户端模块中提交拼车请求并获得匹配。云全球拼车服务模块通过基于遗传的拼车路线和匹配算法生成可接受的匹配。该算法通过显著减少匹配大量用户所需的时间，进一步解决了拼车服务问题。在匹配质量和处理时间方面，实验结果表明，本文提出的基于遗传的拼车路线和匹配算法能够找到最优的拼车路线和匹配结果，并且计算复杂度显著降低，所需服务计算时间较少。
{"title":"Optimizing the Carpool Service Problem with Genetic Algorithm in Service-Based Computing","authors":"Ming-Kai Jiau, Shih-Chia Huang, Chih-Hsian Lin","doi":"10.1109/SCC.2013.56","DOIUrl":"https://doi.org/10.1109/SCC.2013.56","url":null,"abstract":"Carpooling increases the occupancy rate of cars by decreasing the number of empty seats, thereby creating an effective solution to traffic congestion. This paper proposes an intelligent carpool system, BlueNet, which comprises two important modules. These modules are called the Mobile Client module and the Cloud Global Carpool Services module. By using smart handheld devices, users can submit carpool requests and obtain matches within the Mobile Client module via the Cloud Global Carpool Services module. The Cloud Global Carpool Services module generates acceptable matches via the Genetic-based Carpool Route and Matching algorithm. The proposed algorithm furthers the solution to the carpool service problem by dramatically reducing the time required to match a large number of users. In regard to the quality of the matches and processing time, the experimental results show that the proposed Genetic-based Carpool Route and Matching algorithm is able to find carpool route and matching results that are among the most optimal, and operates with significantly less computational complexity to require less services computing time.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"359 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":"132671201","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}
Although quality requirements (QRs) are considered as being of crucial importance in today's service-oriented systems, existing approaches almost exclusively deal with QRs from the service providers' perspective (namely late QRs). The motivation for this paper is to address the analysis of QRs from the service customers' perspective (namely early QRs). The work presented in this paper focuses on the way that early QRs may be modeled and evaluated and demonstrates this approach on a stock trading service system - a real-world practice taken from an international firm in the financial sector. We focus on three QRs that are critical to service systems and especially that of stock trading, namely performance, availability and security. We introduce a modeling paradigm that extends the well-known UML Activity Diagram by explicitly representing these three QRs as an integral part of business process modeling and augments this modeling with quantitative and qualitative reasoning that together provide the means for enhanced decision making by service customers.
{"title":"QRA: A Quality Requirements Analysis Approach for Service Systems","authors":"Jie Sun, Liping Zhao, P. Loucopoulos, Bo Zhou","doi":"10.1109/SCC.2013.48","DOIUrl":"https://doi.org/10.1109/SCC.2013.48","url":null,"abstract":"Although quality requirements (QRs) are considered as being of crucial importance in today's service-oriented systems, existing approaches almost exclusively deal with QRs from the service providers' perspective (namely late QRs). The motivation for this paper is to address the analysis of QRs from the service customers' perspective (namely early QRs). The work presented in this paper focuses on the way that early QRs may be modeled and evaluated and demonstrates this approach on a stock trading service system - a real-world practice taken from an international firm in the financial sector. We focus on three QRs that are critical to service systems and especially that of stock trading, namely performance, availability and security. We introduce a modeling paradigm that extends the well-known UML Activity Diagram by explicitly representing these three QRs as an integral part of business process modeling and augments this modeling with quantitative and qualitative reasoning that together provide the means for enhanced decision making by service customers.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"56 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":"133720052","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 is an increasing demand for context-aware adaptive services that can evolve at runtime in response to unanticipated changes in their environments or functionalities. Enabling the runtime evolution of such context-aware adaptive services is still a major challenge. In this paper, we introduce a novel approach to tackle this challenge. At the development time, our approach explicitly models a context-aware adaptive service from three aspects: functionality, context, and adaptive behaviour. As such, these aspects and their relationships can be clearly captured and easily manipulated. The approach also generates the executable artifacts of the composite service from their models. These artifacts are engineered with the ability to be changed at runtime (i.e. evolvable artifacts). To cope with unanticipated changes, we adopt the models@runtime concept for keeping the service model alive at runtime. This model is then manipulated by the software engineer to take into account such changes. To apply the model changes to the running service's composition, differences between the running service model and its evolved model are computed. Then, adaptation actions corresponding to the differences are generated and applied to the service's evolvable artifacts. To demonstrate the approach applicability, we have used it to develop and evolve two case studies: travel guide and electronic exam services.
{"title":"Enabling Runtime Evolution of Context-Aware Adaptive Services","authors":"Mahmoud Hussein, Jun Han, Jian Yu, A. Colman","doi":"10.1109/SCC.2013.77","DOIUrl":"https://doi.org/10.1109/SCC.2013.77","url":null,"abstract":"There is an increasing demand for context-aware adaptive services that can evolve at runtime in response to unanticipated changes in their environments or functionalities. Enabling the runtime evolution of such context-aware adaptive services is still a major challenge. In this paper, we introduce a novel approach to tackle this challenge. At the development time, our approach explicitly models a context-aware adaptive service from three aspects: functionality, context, and adaptive behaviour. As such, these aspects and their relationships can be clearly captured and easily manipulated. The approach also generates the executable artifacts of the composite service from their models. These artifacts are engineered with the ability to be changed at runtime (i.e. evolvable artifacts). To cope with unanticipated changes, we adopt the models@runtime concept for keeping the service model alive at runtime. This model is then manipulated by the software engineer to take into account such changes. To apply the model changes to the running service's composition, differences between the running service model and its evolved model are computed. Then, adaptation actions corresponding to the differences are generated and applied to the service's evolvable artifacts. To demonstrate the approach applicability, we have used it to develop and evolve two case studies: travel guide and electronic exam services.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"46 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":"134028177","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}
Although significant advances have been seen in service oriented architecture (SOA) experiences. In practice the adoption of SOA at enterprise level is a long-term and complex transformation process. The research on how to extend SOA into an organizational context is still rare. In this paper, model-driven development methodology and platform is presented to handle the complexity of transforming an enterprise into a Service-Oriented Enterprise (SOE). The reference architecture and implementation guide for SOE is described in the methodology. The model-driven platform provides the integrated development and operational environment for SOE. Based on the platform, a total solution for SOE is given which can implement on-demand business.
{"title":"The Methodology, Platform and Solution for Service-Oriented Enterprise","authors":"Rong Wang, Shuangxi Huang, W. Su, Aidan Li","doi":"10.1109/SCC.2013.21","DOIUrl":"https://doi.org/10.1109/SCC.2013.21","url":null,"abstract":"Although significant advances have been seen in service oriented architecture (SOA) experiences. In practice the adoption of SOA at enterprise level is a long-term and complex transformation process. The research on how to extend SOA into an organizational context is still rare. In this paper, model-driven development methodology and platform is presented to handle the complexity of transforming an enterprise into a Service-Oriented Enterprise (SOE). The reference architecture and implementation guide for SOE is described in the methodology. The model-driven platform provides the integrated development and operational environment for SOE. Based on the platform, a total solution for SOE is given which can implement on-demand business.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"4 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":"124848392","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}
Zhiyuan Su, Ling Liu, Mingchu Li, Xinxin Fan, Yang Zhou
Service provision networks are popular platforms for decentralized service management. eBay and Amazon are two representative examples of enabling and hosting service provision networks for their customers. Trust management is a critical component for scaling service provision networks to larger set of participants. This paper presents Service Trust, a quality sensitive and attack resilient trust management facility for service provision networks. Service Trust has three unique features. First, it encapsulates quality-sensitive feedbacks by multi-scale rating scheme and incorporates the variances of user's behaviors into the local trust algorithm. Second, Service Trust measures the similarity of two users' feedback behavior and aggregate the local trust values into the global trust algorithm by exploiting pairwise feedback similarity scores to weight the contributions of local trust values towards the global trust of a participant. Finally, pairwise feedback similarity weighted trust propagation is utilized to further strengthen the robustness of global trust computation against malicious or sparse feedbacks. Experimental evaluation with independent and colluding attack models show that Service Trust is highly resilient to various attacks and highly effective compared to Eigen Trust, one of the most popular and representative trust models to date.
{"title":"ServiceTrust: Trust Management in Service Provision Networks","authors":"Zhiyuan Su, Ling Liu, Mingchu Li, Xinxin Fan, Yang Zhou","doi":"10.1109/SCC.2013.31","DOIUrl":"https://doi.org/10.1109/SCC.2013.31","url":null,"abstract":"Service provision networks are popular platforms for decentralized service management. eBay and Amazon are two representative examples of enabling and hosting service provision networks for their customers. Trust management is a critical component for scaling service provision networks to larger set of participants. This paper presents Service Trust, a quality sensitive and attack resilient trust management facility for service provision networks. Service Trust has three unique features. First, it encapsulates quality-sensitive feedbacks by multi-scale rating scheme and incorporates the variances of user's behaviors into the local trust algorithm. Second, Service Trust measures the similarity of two users' feedback behavior and aggregate the local trust values into the global trust algorithm by exploiting pairwise feedback similarity scores to weight the contributions of local trust values towards the global trust of a participant. Finally, pairwise feedback similarity weighted trust propagation is utilized to further strengthen the robustness of global trust computation against malicious or sparse feedbacks. Experimental evaluation with independent and colluding attack models show that Service Trust is highly resilient to various attacks and highly effective compared to Eigen Trust, one of the most popular and representative trust models to date.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"97 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":"125096365","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}
Near Field Communication (NFC) is a new short-range wireless communication technology that enabled simple, security and intuitive peer-to-peer communication between NFC-enabled devices. The advent of NFC has given rise to several interesting applications under short-range radio technology. Among the interesting applications, mobile payment is the first application in the marketplace. In the research, we proposed NFC-Micro SD technology, a new technology in NFC field. The new technology creates a more convenient environment and lower threshold for mobile payment to enter in. The collaborative mobile payment solution follows the original security mechanism of the traditional credit cards operation, and improve the value of the partners in the collaborative value chain, included the hardware produced and software development. The two modes, passive mode and active mode, provided by NFC-Micro SD technology also provide the reliable transaction for the mobile payment. In summary, the NFC mobile payment solution via NFC-Micro SD technology improves the higher acceptance, using willingness, and loyalty of the partners and users. It also makes the value chain as the collaborative solution. Thus, the NFC mobile payment via NFC-Micro SD technology can be seen as the better mobile payment solution and will lead the development of the mobile payment market.
{"title":"Promoting Collaborative Mobile Payment by Using NFC-Micro SD Technology","authors":"S. Wu, Chyan Yang","doi":"10.1109/SCC.2013.52","DOIUrl":"https://doi.org/10.1109/SCC.2013.52","url":null,"abstract":"Near Field Communication (NFC) is a new short-range wireless communication technology that enabled simple, security and intuitive peer-to-peer communication between NFC-enabled devices. The advent of NFC has given rise to several interesting applications under short-range radio technology. Among the interesting applications, mobile payment is the first application in the marketplace. In the research, we proposed NFC-Micro SD technology, a new technology in NFC field. The new technology creates a more convenient environment and lower threshold for mobile payment to enter in. The collaborative mobile payment solution follows the original security mechanism of the traditional credit cards operation, and improve the value of the partners in the collaborative value chain, included the hardware produced and software development. The two modes, passive mode and active mode, provided by NFC-Micro SD technology also provide the reliable transaction for the mobile payment. In summary, the NFC mobile payment solution via NFC-Micro SD technology improves the higher acceptance, using willingness, and loyalty of the partners and users. It also makes the value chain as the collaborative solution. Thus, the NFC mobile payment via NFC-Micro SD technology can be seen as the better mobile payment solution and will lead the development of the mobile payment market.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"8 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":"126377633","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 Navdriver, a novel Software-as-a-Service technology capable of automatically inserting hyperlinks on subscribers' Web pages. Its functionality leverages hotlink assignment algorithms which have been a subject of study in the last decade. The focus of this paper is on describing the underpinnings of Navdriver from the point of view of its SaaS architecture and its interaction with subscribers' Web sites and their pages' visitors. The paper also presents lessons learned over the past five years since Navdriver was officially launched and deployed in live production websites. Navdriver is freely available and supports the most predominant Web browsers and Web technologies.
{"title":"Navdriver: Adaptive Websites via SaaS","authors":"Miguel Vargas Martin","doi":"10.1109/SCC.2013.60","DOIUrl":"https://doi.org/10.1109/SCC.2013.60","url":null,"abstract":"This paper describes Navdriver, a novel Software-as-a-Service technology capable of automatically inserting hyperlinks on subscribers' Web pages. Its functionality leverages hotlink assignment algorithms which have been a subject of study in the last decade. The focus of this paper is on describing the underpinnings of Navdriver from the point of view of its SaaS architecture and its interaction with subscribers' Web sites and their pages' visitors. The paper also presents lessons learned over the past five years since Navdriver was officially launched and deployed in live production websites. Navdriver is freely available and supports the most predominant Web browsers and Web technologies.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"75 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":"121818035","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}
R. Akkiraju, Mark A. Smith, Shun Jiang, Daniel B. Greenia, Shyam Pusapaty
We present a method and a system for assessing the competitiveness of IT service solutions. The method enables sales teams to assess the competitiveness of their IT service solutions created during the sales phase in response to request for proposal (RfP). It involves comparing unit costs and unit prices of a given solution with those of client expectations, comparable prior deals and agreed upon rates defined within an IT service provider organization, competition and market. Our contributions include an approach to modeling IT service solutions in a consistent manner to enable comparison. This is a pre-requisite to the second step of comparing IT service solutions. Second, an approach to comparing IT service solutions is proposed. The approach takes into account structured and unstructured attributes as well as qualitative and quantitative values of attributes during comparison. We are currently performing precision and recall experiments at an IT service organization using 200 prior deals. Initial results are encouraging. In the absense of any prior tools to do this, our system is already proving to be a valuable asset to the IT service organization that we are developing the solution for.
{"title":"On Assessing the Competitiveness of IT Service Solutions","authors":"R. Akkiraju, Mark A. Smith, Shun Jiang, Daniel B. Greenia, Shyam Pusapaty","doi":"10.1109/SCC.2013.119","DOIUrl":"https://doi.org/10.1109/SCC.2013.119","url":null,"abstract":"We present a method and a system for assessing the competitiveness of IT service solutions. The method enables sales teams to assess the competitiveness of their IT service solutions created during the sales phase in response to request for proposal (RfP). It involves comparing unit costs and unit prices of a given solution with those of client expectations, comparable prior deals and agreed upon rates defined within an IT service provider organization, competition and market. Our contributions include an approach to modeling IT service solutions in a consistent manner to enable comparison. This is a pre-requisite to the second step of comparing IT service solutions. Second, an approach to comparing IT service solutions is proposed. The approach takes into account structured and unstructured attributes as well as qualitative and quantitative values of attributes during comparison. We are currently performing precision and recall experiments at an IT service organization using 200 prior deals. Initial results are encouraging. In the absense of any prior tools to do this, our system is already proving to be a valuable asset to the IT service organization that we are developing the solution for.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"1 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":"126926178","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}
Web services are loosely-coupled business applications willing to cooperate in distributed settings within different groups called communities. Communities aim to provide better visibility, efficiency, market share and total payoff. There are a number of proposed mechanisms and models on aggregating web services and making them cooperate within their communities. However, forming optimal and stable communities as coalitions to maximize individual and group efficiency and income has not been addressed yet. In this paper, we propose an efficient coalition formation mechanism using cooperative game-theoretic techniques. We propose a mechanism for community membership requests and selections of web services in the scenarios where established communities already exist. Moreover, we analyze the scenarios where communities are not established yet and web services can form multiple communities. The ultimate objective is to develop a mechanism for web services to form stable groups allowing them to maximize their efficiency and generate near-optimal (welfare-maximizing) communities. The theoretical and simulation results show that our algorithms provide web services and community owners with applicable and near-optimal decision making mechanisms.
{"title":"Efficient Coalition Formation for Web Services","authors":"E. K. Asl, J. Bentahar, H. Otrok, R. Mizouni","doi":"10.1109/SCC.2013.79","DOIUrl":"https://doi.org/10.1109/SCC.2013.79","url":null,"abstract":"Web services are loosely-coupled business applications willing to cooperate in distributed settings within different groups called communities. Communities aim to provide better visibility, efficiency, market share and total payoff. There are a number of proposed mechanisms and models on aggregating web services and making them cooperate within their communities. However, forming optimal and stable communities as coalitions to maximize individual and group efficiency and income has not been addressed yet. In this paper, we propose an efficient coalition formation mechanism using cooperative game-theoretic techniques. We propose a mechanism for community membership requests and selections of web services in the scenarios where established communities already exist. Moreover, we analyze the scenarios where communities are not established yet and web services can form multiple communities. The ultimate objective is to develop a mechanism for web services to form stable groups allowing them to maximize their efficiency and generate near-optimal (welfare-maximizing) communities. The theoretical and simulation results show that our algorithms provide web services and community owners with applicable and near-optimal decision making mechanisms.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"1383 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":"126997615","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}
Finding and recommending suitable services on mobile devices is an important topic in today's society where most people rely on their smartphones to provide solutions to their day-to-day problems or to receive prescribed services. Recent research has attempted to use role-based approaches to recommend mobile services to other members among the same context group. However, these proposed algorithms are inefficient and may not scale to cope with the huge amount of mobile traffics in the real-world. This paper proposes novel algorithms with better runtime complexity, and further extends them to Map Reduce style to take advantage of popular distributed computing platforms. Experiments running on a medium-sized high performance computing cluster demonstrate that our proposed algorithms outperform previous work in running time complexity and scalability.
{"title":"Context-Aware Service Recommendation on High Performance Cluster","authors":"Zhiwei Yu, Victor W. Chu, R. Wong","doi":"10.1109/SCC.2013.87","DOIUrl":"https://doi.org/10.1109/SCC.2013.87","url":null,"abstract":"Finding and recommending suitable services on mobile devices is an important topic in today's society where most people rely on their smartphones to provide solutions to their day-to-day problems or to receive prescribed services. Recent research has attempted to use role-based approaches to recommend mobile services to other members among the same context group. However, these proposed algorithms are inefficient and may not scale to cope with the huge amount of mobile traffics in the real-world. This paper proposes novel algorithms with better runtime complexity, and further extends them to Map Reduce style to take advantage of popular distributed computing platforms. Experiments running on a medium-sized high performance computing cluster demonstrate that our proposed algorithms outperform previous work in running time complexity and scalability.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"39 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":"124370055","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
扫码关注我们
求助内容：
应助结果提醒方式：