Yuankui Li, Linzhang Wang, Xuandong Li, Yuanfang Cai
It is well-known that as software system evolves, the source code tends to deviate from its design model so that maintaining their consistence is challenging. Our objective is to detect code changes that influence designed program behaviour which are referred as design level changes and update the behavioural model timely and automatically to maintain consistence. We propose an approach that filters out low-level source code changes that do not influence program behaviour, abstracts code changes into updating operations for behavioral model, and automates the integration and update of activity diagrams to maintain consistence. We've recognised that it is not uncommon for developers to introduce quick and dirty implementation that unnecessarily increases program complexity or introduces suboptimal behaviour changes. So while merging code changes into behaviour model, our approach also calculates cyclometric complexity variation before and after the process so that developers can be alerted of significant and/or detrimental changes. Our tool allows the user to approve the change in code before merging and updating the model.
{"title":"Detecting source code changes to maintain the consistence of behavioral model","authors":"Yuankui Li, Linzhang Wang, Xuandong Li, Yuanfang Cai","doi":"10.1145/2430475.2430482","DOIUrl":"https://doi.org/10.1145/2430475.2430482","url":null,"abstract":"It is well-known that as software system evolves, the source code tends to deviate from its design model so that maintaining their consistence is challenging. Our objective is to detect code changes that influence designed program behaviour which are referred as design level changes and update the behavioural model timely and automatically to maintain consistence. We propose an approach that filters out low-level source code changes that do not influence program behaviour, abstracts code changes into updating operations for behavioral model, and automates the integration and update of activity diagrams to maintain consistence. We've recognised that it is not uncommon for developers to introduce quick and dirty implementation that unnecessarily increases program complexity or introduces suboptimal behaviour changes. So while merging code changes into behaviour model, our approach also calculates cyclometric complexity variation before and after the process so that developers can be alerted of significant and/or detrimental changes. Our tool allows the user to approve the change in code before merging and updating the model.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80645524","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}
Internetware is a new paradigm proposed in recent years, which is defined as a kind of software constructed by a set of autonomous software entities distributed over the Internet. The environment where Internetware operates, including the Internet and other physical condition that the domain should hold, changes unexpectedly and comes with uncertainty. So the self-adaptation issue becomes inevitable in terms of dynamically configuring the Internetware. Here come two basic questions: how can we derive the adaptation problem in Internetware and how can we solve this problem with some adaptation mechanisms? In this paper, we focus on the requirements level for solving this problem and propose to use i* framework for modeling requirements of Internetware and deriving the adaptation problem from the i* models. To solve the adaptation problem, we provide a synergy approach involving i* models and widely accepted self-adaptation process---the MAPE loop, and apply ECA (3-tuple of ) to present the rationale for reconfiguration decisions.
{"title":"Requirements modeling and system reconfiguration for self-adaptation of Internetware","authors":"Zhuo-Qun Yang, Jin Zhi","doi":"10.1145/2430475.2430486","DOIUrl":"https://doi.org/10.1145/2430475.2430486","url":null,"abstract":"Internetware is a new paradigm proposed in recent years, which is defined as a kind of software constructed by a set of autonomous software entities distributed over the Internet. The environment where Internetware operates, including the Internet and other physical condition that the domain should hold, changes unexpectedly and comes with uncertainty. So the self-adaptation issue becomes inevitable in terms of dynamically configuring the Internetware. Here come two basic questions: how can we derive the adaptation problem in Internetware and how can we solve this problem with some adaptation mechanisms? In this paper, we focus on the requirements level for solving this problem and propose to use i* framework for modeling requirements of Internetware and deriving the adaptation problem from the i* models. To solve the adaptation problem, we provide a synergy approach involving i* models and widely accepted self-adaptation process---the MAPE loop, and apply ECA (3-tuple of <Event, Condition, Action>) to present the rationale for reconfiguration decisions.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77781723","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 Internet of Things (IoT), functionalities of devices are encapsulated as real-world services to interact with other things or traditional web services to realize the seamless integration physical world with information world, where service discovery plays an important role. However, the resource-constrained and mobility natures of devices and intermittent disconnection of wireless network result in services in IoT having highly dynamic environment, which asks for different requirements for context-aware service discovery approach than traditional web services and brings new challenges for service discovery in IoT. In this paper, we analyze the role of context and relations with entities in IoT firstly; then combing the characteristics of data in IoT, a common ontology based context model with the ability to handle uncertainty and temporal aspects of context is proposed and Dynamic Bayesian networks (DBN) is adopted to reason about these contexts for supporting to sense current situation. Finally, based on the context model and reasoning approach proposed, we present a context-aware service discovery architecture for IoT to provide an efficient infrastructure to support user-centric and environment-aware service provision.
在物联网(Internet of Things, IoT)中，设备的功能被封装为现实世界的服务，与其他事物或传统的web服务进行交互，实现物理世界与信息世界的无缝集成，其中服务发现起着重要的作用。然而，由于设备的资源约束和移动性以及无线网络的间歇性断开，使得物联网中的服务具有高度动态的环境，这就对上下文感知的服务发现方法提出了不同于传统web服务的要求，给物联网中的服务发现带来了新的挑战。本文首先分析了上下文在物联网中的作用及其与实体的关系;然后，结合物联网数据的特点，提出了一种通用的基于本体的上下文模型，该模型具有处理上下文不确定性和时变方面的能力，并采用动态贝叶斯网络(DBN)对这些上下文进行推理，支持对当前状态的感知。最后，基于所提出的上下文模型和推理方法，我们提出了一种上下文感知的物联网服务发现架构，为支持以用户为中心和环境感知的服务提供提供了高效的基础设施。
{"title":"Service discovery for internet of things: a context-awareness perspective","authors":"Qiang Wei, Zhi Jin","doi":"10.1145/2430475.2430500","DOIUrl":"https://doi.org/10.1145/2430475.2430500","url":null,"abstract":"In Internet of Things (IoT), functionalities of devices are encapsulated as real-world services to interact with other things or traditional web services to realize the seamless integration physical world with information world, where service discovery plays an important role. However, the resource-constrained and mobility natures of devices and intermittent disconnection of wireless network result in services in IoT having highly dynamic environment, which asks for different requirements for context-aware service discovery approach than traditional web services and brings new challenges for service discovery in IoT. In this paper, we analyze the role of context and relations with entities in IoT firstly; then combing the characteristics of data in IoT, a common ontology based context model with the ability to handle uncertainty and temporal aspects of context is proposed and Dynamic Bayesian networks (DBN) is adopted to reason about these contexts for supporting to sense current situation. Finally, based on the context model and reasoning approach proposed, we present a context-aware service discovery architecture for IoT to provide an efficient infrastructure to support user-centric and environment-aware service provision.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79165907","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}
One of the prominent properties of the Internetware Software Paradigm is its evolutionary characteristic. It is recognised that the evolution of software systems are driven by the needs of final users, and influenced by changes in the operational environments and technology advancement. The evolution of biological and social systems often forms a spiral incremental tendency where the changes are continuous, and stepwise. Inspired by the classical pyramid model of Maslow on Human needs, we propose to understand the evolution of software in the Internetware era with a double pyramid model. In other words, user's needs are gradually changing and their expectations to the system functionalities and qualities are getting higher; at the same time, more and more sophisticated software services become available, they provide richer functionalities, better qualities, more diversified choices, and more appealing user experiences. We first structure the development of user expectation and the capability of services as two separate pyramids, and then we define how the two pyramids interacts and influence each other within a co-evolution model. An example of Internetware system development is presented to illustrate how the co-evolution model helps shorten life cycle of system development and achieve high quality and efficiency at the same time.
{"title":"Understanding evolution in Internetware using a double pyramids model","authors":"Jun Wang, Lin Liu, Jianmin Wang","doi":"10.1145/2430475.2430487","DOIUrl":"https://doi.org/10.1145/2430475.2430487","url":null,"abstract":"One of the prominent properties of the Internetware Software Paradigm is its evolutionary characteristic. It is recognised that the evolution of software systems are driven by the needs of final users, and influenced by changes in the operational environments and technology advancement. The evolution of biological and social systems often forms a spiral incremental tendency where the changes are continuous, and stepwise. Inspired by the classical pyramid model of Maslow on Human needs, we propose to understand the evolution of software in the Internetware era with a double pyramid model. In other words, user's needs are gradually changing and their expectations to the system functionalities and qualities are getting higher; at the same time, more and more sophisticated software services become available, they provide richer functionalities, better qualities, more diversified choices, and more appealing user experiences. We first structure the development of user expectation and the capability of services as two separate pyramids, and then we define how the two pyramids interacts and influence each other within a co-evolution model. An example of Internetware system development is presented to illustrate how the co-evolution model helps shorten life cycle of system development and achieve high quality and efficiency at the same time.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83733583","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}
Xiujuan Ji, Jufeng Yang, Jing Xu, Lei Feng, Xiaohong Li
In this paper, we present a new tool, RL_Detector, which performs static analysis to detect resource leaks for C programs. The algorithm is inter-procedural and path-sensitive, and it is based on an underlying resource management property: the data flow from resource allocation point must reach resource deallocation point, otherwise the resource is leaked. For each resource, it symbolically executes the program to collect the constraints of all the paths and recorded as some sets. Then the data flow condition can be computed through these sets of all the paths. Finally, the resource leak detection is reduced to the satisfiability of DFC (the Data Flow Condition). It has been effective at detecting resource leak in the SPEC2000 benchmarks and in an open source software project, the actual test results show that the tool keeps the false positive rate below 10% and works on millions of lines of code in a matter of minutes.
{"title":"Interprocedural path-sensitive resource leaks detection for C programs","authors":"Xiujuan Ji, Jufeng Yang, Jing Xu, Lei Feng, Xiaohong Li","doi":"10.1145/2430475.2430494","DOIUrl":"https://doi.org/10.1145/2430475.2430494","url":null,"abstract":"In this paper, we present a new tool, RL_Detector, which performs static analysis to detect resource leaks for C programs. The algorithm is inter-procedural and path-sensitive, and it is based on an underlying resource management property: the data flow from resource allocation point must reach resource deallocation point, otherwise the resource is leaked. For each resource, it symbolically executes the program to collect the constraints of all the paths and recorded as some sets. Then the data flow condition can be computed through these sets of all the paths. Finally, the resource leak detection is reduced to the satisfiability of DFC (the Data Flow Condition). It has been effective at detecting resource leak in the SPEC2000 benchmarks and in an open source software project, the actual test results show that the tool keeps the false positive rate below 10% and works on millions of lines of code in a matter of minutes.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82010913","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}
Software Change Impact Analysis (CIA) is an essential technique to identify the unpredicted and potential effects caused by software changes. A rich body of different CIA techniques, especially static CIA techniques, have continuously emerged in recent years. However, it is difficult for researchers or practitioners to decide which technique is most appropriate for their needs, or which CIA technique is more effective. Unfortunately, there was only a few work on the comparison of the CIA techniques. This paper presents a comparison study of different types of popular static CIA approaches, i.e., structural static analysis, textual analysis, and historical analysis. For each kind of static CIA approach, we introduce a representative technique, that is FCA -- CIA, ROSE, and IRC2M, respectively. Finally, some empirical studies are conducted on three real-world programs to compare the accuracy of these CIA techniques based on the precision and recall metrics. The results show that the accuracy of these three CIA techniques is different, and FCA - CIA has the best precision while the IRC2M has the best recall.
{"title":"A comparative study of static CIA techniques","authors":"Xiaobing Sun, Bin Li, Bixin Li, Wanzhi Wen","doi":"10.1145/2430475.2430498","DOIUrl":"https://doi.org/10.1145/2430475.2430498","url":null,"abstract":"Software Change Impact Analysis (CIA) is an essential technique to identify the unpredicted and potential effects caused by software changes. A rich body of different CIA techniques, especially static CIA techniques, have continuously emerged in recent years. However, it is difficult for researchers or practitioners to decide which technique is most appropriate for their needs, or which CIA technique is more effective. Unfortunately, there was only a few work on the comparison of the CIA techniques. This paper presents a comparison study of different types of popular static CIA approaches, i.e., structural static analysis, textual analysis, and historical analysis. For each kind of static CIA approach, we introduce a representative technique, that is FCA -- CIA, ROSE, and IRC2M, respectively. Finally, some empirical studies are conducted on three real-world programs to compare the accuracy of these CIA techniques based on the precision and recall metrics. The results show that the accuracy of these three CIA techniques is different, and FCA - CIA has the best precision while the IRC2M has the best recall.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84949232","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}
Chen Li, Linpeng Huang, Luxi Chen, Xu Li, Weichao Luo
Compared to the traditional software architecture, Dynamic Software Architectures (DSAs) should be able to describe the changes of the system and to effect modifications during system execution, especially for dynamic evolution. To reflect the changes during system execution, we present a formalism for describing architecture structure and interaction behavior, and we also specify four evolution rules for software architecture. Our work expands the idea in three directions. The first is to formalize the architecture structure and interaction behavior including components, connectors and an architectural reference model. The second direction is that we formalize four dynamic evolution rules which DSAs should support, that is, addition, removal, replacement and reconfiguration. Another direction is that we verify software architecture consistency and integrity after dynamic evolution. We use a client/server application as a running example throughout the paper to demonstrate our approach. Our work provides a precise formal specification for software architecture and a rigorous verification for dynamic evolution.
{"title":"Dynamic software architectures: formal specification and verification with CSP","authors":"Chen Li, Linpeng Huang, Luxi Chen, Xu Li, Weichao Luo","doi":"10.1145/2430475.2430480","DOIUrl":"https://doi.org/10.1145/2430475.2430480","url":null,"abstract":"Compared to the traditional software architecture, Dynamic Software Architectures (DSAs) should be able to describe the changes of the system and to effect modifications during system execution, especially for dynamic evolution. To reflect the changes during system execution, we present a formalism for describing architecture structure and interaction behavior, and we also specify four evolution rules for software architecture. Our work expands the idea in three directions. The first is to formalize the architecture structure and interaction behavior including components, connectors and an architectural reference model. The second direction is that we formalize four dynamic evolution rules which DSAs should support, that is, addition, removal, replacement and reconfiguration. Another direction is that we verify software architecture consistency and integrity after dynamic evolution. We use a client/server application as a running example throughout the paper to demonstrate our approach. Our work provides a precise formal specification for software architecture and a rigorous verification for dynamic evolution.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82548804","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 composition provides an effective way to conduct cross-organizational business transactions. Some protocols and frameworks have been proposed to ensure ACID properties of transactional service requisitions from the perspective of a service requester. However, few of them have focused on how to optimize the services' profits from the perspective of a service provider. In this paper, we present a priority-based transaction commit protocol for composite Web services. For this protocol, Nash Bargaining Solution (NBS) is used to differentiate service requesters so that services (i.e., resources) can be allocated with different priorities. In this way, the profit of a service provider can be maximized with proportional fairness. For service requesters, the proposed protocol can guarantee the atomicity of service requisitions. Our experimental results reveal that the proposed protocol can significantly enhance the profit of service providers without violating atomicity of Web service transactions.
{"title":"A priority-based transaction commit protocol for composite web services","authors":"Wei Song, Zheng Gao, Jing Cai, Xiaoxing Ma","doi":"10.1145/2430475.2430477","DOIUrl":"https://doi.org/10.1145/2430475.2430477","url":null,"abstract":"Service composition provides an effective way to conduct cross-organizational business transactions. Some protocols and frameworks have been proposed to ensure ACID properties of transactional service requisitions from the perspective of a service requester. However, few of them have focused on how to optimize the services' profits from the perspective of a service provider. In this paper, we present a priority-based transaction commit protocol for composite Web services. For this protocol, Nash Bargaining Solution (NBS) is used to differentiate service requesters so that services (i.e., resources) can be allocated with different priorities. In this way, the profit of a service provider can be maximized with proportional fairness. For service requesters, the proposed protocol can guarantee the atomicity of service requisitions. Our experimental results reveal that the proposed protocol can significantly enhance the profit of service providers without violating atomicity of Web service transactions.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86029637","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}
Software evolves all the time because of the changing requirements, in particular, in the diverse Internet environment. Evolution history recorded in software repositories, e.g., Version Control Systems, reflects people's software development practice. Exploring this history could help practitioners to reuse the best practices therefore improve productivity and software quality. Because of the difficulty of collecting and standardizing data, most existing work could only utilize small project set. In this study, we target the open source software universe to build a universal code evolution model for large-scale data. We consider code evolution from two aspects: code version changing history in a single project and code reuse history in the whole universe. In the model, files/modules are built as nodes, and relations (version change or reuse) between files/modules are built as connections. Based on the model, we design and implement a code evolution review framework, i.e., Code Evolution Reviewer (CER), which provides a series of data interfaces to review code evolution history, in particular, code version changing in single project and code reuse among projects. Further, CER could be utilized to explore best practices across large-scale project set.
{"title":"Review code evolution history in OSS universe","authors":"Jiaxin Zhu, Hongwu Lin, Minghui Zhou, Hong Mei","doi":"10.1145/2430475.2430488","DOIUrl":"https://doi.org/10.1145/2430475.2430488","url":null,"abstract":"Software evolves all the time because of the changing requirements, in particular, in the diverse Internet environment. Evolution history recorded in software repositories, e.g., Version Control Systems, reflects people's software development practice. Exploring this history could help practitioners to reuse the best practices therefore improve productivity and software quality. Because of the difficulty of collecting and standardizing data, most existing work could only utilize small project set. In this study, we target the open source software universe to build a universal code evolution model for large-scale data. We consider code evolution from two aspects: code version changing history in a single project and code reuse history in the whole universe. In the model, files/modules are built as nodes, and relations (version change or reuse) between files/modules are built as connections. Based on the model, we design and implement a code evolution review framework, i.e., Code Evolution Reviewer (CER), which provides a series of data interfaces to review code evolution history, in particular, code version changing in single project and code reuse among projects. Further, CER could be utilized to explore best practices across large-scale project set.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89447028","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 more and more services that fulfill similar functionality, such as image service provided by Flickr, Picasa and Facebook. Which should be adopted to construct our software system in the open, dynamic and non-deterministic Internet environment is a key problem. Earlier work[15, 9] analyze this problem from the point view of QoS and established generic and extensible QoS computation framework for service selection. However those framework are almost designed for individuals. As social network emerges and gets widespread, people tend to be more connected and self-organize themselves into groups. Benefits of all members should be considered when we select service for group. In this article, we propose a revised group recommendation algorithm which takes advantage of collaborative filtering technology for service selection. As the experiment demonstrates, our algorithm exhibits high accuracy.
{"title":"A group recommendation approach for service selection","authors":"Tao Liu, Feng Xu, Yuan Yao, Jian Lu","doi":"10.1145/2430475.2430485","DOIUrl":"https://doi.org/10.1145/2430475.2430485","url":null,"abstract":"There are more and more services that fulfill similar functionality, such as image service provided by Flickr, Picasa and Facebook. Which should be adopted to construct our software system in the open, dynamic and non-deterministic Internet environment is a key problem. Earlier work[15, 9] analyze this problem from the point view of QoS and established generic and extensible QoS computation framework for service selection. However those framework are almost designed for individuals. As social network emerges and gets widespread, people tend to be more connected and self-organize themselves into groups. Benefits of all members should be considered when we select service for group. In this article, we propose a revised group recommendation algorithm which takes advantage of collaborative filtering technology for service selection. As the experiment demonstrates, our algorithm exhibits high accuracy.","PeriodicalId":20631,"journal":{"name":"Proceedings of the 8th Asia-Pacific Symposium on Internetware","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88792701","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
扫码关注我们
求助内容：
应助结果提醒方式：