There is a growing number of services in the age of information. Therefore, choosing a satisfactory service has become increasingly difficult. One way to solve this problem is to construct a recommendation system. Selecting a set of users called neighbor user set and then generating the recommended services through collaborative filtering is a commonly used method to implement a recommendation system. In the recommended process, the user reputation is always considered since we prone to trust the users with high reputation. However, the current recommendation System lacks detailed context information analysis in user reputation calculation. In this paper, we propose a context-aware reputation calculation method based on user ratings. We first propose a novel method to analysis the impact of different contexts on user ratings. Then, we apply the context information of target user to obtain neighbor user set. Finally, we generate services for target user based on his neighbor user set. Experiments show that our method has better accuracy than other traditional methods.
{"title":"Service Recommendation with Context-Aware User Reputation Evaluation","authors":"Zhiheng Wu, Jinglin Li, Qibo Sun, Ao Zhou","doi":"10.1109/SC2.2017.47","DOIUrl":"https://doi.org/10.1109/SC2.2017.47","url":null,"abstract":"There is a growing number of services in the age of information. Therefore, choosing a satisfactory service has become increasingly difficult. One way to solve this problem is to construct a recommendation system. Selecting a set of users called neighbor user set and then generating the recommended services through collaborative filtering is a commonly used method to implement a recommendation system. In the recommended process, the user reputation is always considered since we prone to trust the users with high reputation. However, the current recommendation System lacks detailed context information analysis in user reputation calculation. In this paper, we propose a context-aware reputation calculation method based on user ratings. We first propose a novel method to analysis the impact of different contexts on user ratings. Then, we apply the context information of target user to obtain neighbor user set. Finally, we generate services for target user based on his neighbor user set. Experiments show that our method has better accuracy than other traditional methods.","PeriodicalId":188326,"journal":{"name":"2017 IEEE 7th International Symposium on Cloud and Service Computing (SC2)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129159148","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 study combined service QFD (Quality Foundation Deployment) method and the TRIZ (Theory of Inventive Problem Solving) and to resign the lucky draw service system from web version to mobile version. We develop and demonstrate a structural framework to modify the service design process in three different problem solving phases. The case study also purposes the new application of QR code technology, which let the mobile version of the lucky draw system is more effective and has more competitive advantage after practical launching.
本研究将服务QFD (Quality Foundation Deployment)方法与TRIZ (theoretical of Inventive Problem Solving)相结合，将抽奖服务系统从网页版转到移动版。我们开发并演示了一个结构框架，用于在三个不同的问题解决阶段修改服务设计过程。本案例研究还着眼于二维码技术的新应用，使手机版抽奖系统在实际推出后更加有效，更具竞争优势。
{"title":"Integrating Service QFD and TRIZ for a Lucky Draw System Design: The Case Study","authors":"Fang-Mei Tseng, Ju-yin Weng","doi":"10.1109/SC2.2017.36","DOIUrl":"https://doi.org/10.1109/SC2.2017.36","url":null,"abstract":"This study combined service QFD (Quality Foundation Deployment) method and the TRIZ (Theory of Inventive Problem Solving) and to resign the lucky draw service system from web version to mobile version. We develop and demonstrate a structural framework to modify the service design process in three different problem solving phases. The case study also purposes the new application of QR code technology, which let the mobile version of the lucky draw system is more effective and has more competitive advantage after practical launching.","PeriodicalId":188326,"journal":{"name":"2017 IEEE 7th International Symposium on Cloud and Service Computing (SC2)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126730576","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}
As the semiconductor manufacturing technology advances, the size of a wafer becomes bigger and the critical dimension becomes smaller than before. This means a wafer can be used to produce more chips. However, the process of manufacturing chips is costly while using today's semiconductor manufacturing technology. Any defect on the wafer may fail the final product and cause large business loss. To reduce the chance of defects on the wafer, the parameters of the manufacturing environment must be precisely controlled. To achieve this goal, a monitoring system is usually used to collect real-time information, which helps shorten the decision time for changing the parameters of the manufacturing environment. For now, most of the semiconductor manufacturing machines support the SECS/GEM standard, which defines how to obtain the monitoring data of the machines via TCP/IP. The problem is that, the existing monitoring approach rarely supports failover and needs human intervention when the system crashes. This implies a long recovery time. Moreover, the failure may further cause other problems. For example, a manufacturing alarm system could generate a false alarm or overlook an important abnormality during the failure time, since the monitoring system fails to feed any data to the alarm system. To solve this problem, we introduce a new fault-tolerance monitoring mechanism based on the techniques of server redundancy and checkpointing. With the proposed approach, the monitoring system is able to achieve a very small downtime, and consequently helps the manufacturing process and the yield rate.
{"title":"A Fault Tolerance Mechanism for Semiconductor Equipment Monitoring","authors":"Shao-Jui Chen, Hsueh-Wen Liu, Wei-Jen Wang","doi":"10.1109/SC2.2017.33","DOIUrl":"https://doi.org/10.1109/SC2.2017.33","url":null,"abstract":"As the semiconductor manufacturing technology advances, the size of a wafer becomes bigger and the critical dimension becomes smaller than before. This means a wafer can be used to produce more chips. However, the process of manufacturing chips is costly while using today's semiconductor manufacturing technology. Any defect on the wafer may fail the final product and cause large business loss. To reduce the chance of defects on the wafer, the parameters of the manufacturing environment must be precisely controlled. To achieve this goal, a monitoring system is usually used to collect real-time information, which helps shorten the decision time for changing the parameters of the manufacturing environment. For now, most of the semiconductor manufacturing machines support the SECS/GEM standard, which defines how to obtain the monitoring data of the machines via TCP/IP. The problem is that, the existing monitoring approach rarely supports failover and needs human intervention when the system crashes. This implies a long recovery time. Moreover, the failure may further cause other problems. For example, a manufacturing alarm system could generate a false alarm or overlook an important abnormality during the failure time, since the monitoring system fails to feed any data to the alarm system. To solve this problem, we introduce a new fault-tolerance monitoring mechanism based on the techniques of server redundancy and checkpointing. With the proposed approach, the monitoring system is able to achieve a very small downtime, and consequently helps the manufacturing process and the yield rate.","PeriodicalId":188326,"journal":{"name":"2017 IEEE 7th International Symposium on Cloud and Service Computing (SC2)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115753839","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}
Hsin-Ta Chiao, C. Lin, Yue-Shan Chang, Ruey-Kai Sheu, Lung-Pin Chen, S. Yuan
ONVIF (Open Network Video Interface Forum) is a popular standard for the video surveillance industries. Since ONVIF specifications do not provide fault-tolerant functions to deal with NVT (Network Video Transmitter) or NVS (Network Video Storage) failure, we propose a fault-tolerant solution for both ONVIF NVT and NVS in this paper. The proposed fault-tolerant extension is also possible to be deployed over cloud-based environments, such as IaaS (Infrastructure as a Service) platforms. The proposed solution is evaluated by the following three performance metrics: the access response time for ONVIF web services, the video recording interrupt duration due to NVS failure, and the video black out time of the surveillance video monitoring system. The experimental results show that all the metrics are within the acceptable range for a real world video surveillance system.
{"title":"A Fault-Tolerant ONVIF Standard Extension for Cloud-Based Surveillance Systems","authors":"Hsin-Ta Chiao, C. Lin, Yue-Shan Chang, Ruey-Kai Sheu, Lung-Pin Chen, S. Yuan","doi":"10.1109/SC2.2017.38","DOIUrl":"https://doi.org/10.1109/SC2.2017.38","url":null,"abstract":"ONVIF (Open Network Video Interface Forum) is a popular standard for the video surveillance industries. Since ONVIF specifications do not provide fault-tolerant functions to deal with NVT (Network Video Transmitter) or NVS (Network Video Storage) failure, we propose a fault-tolerant solution for both ONVIF NVT and NVS in this paper. The proposed fault-tolerant extension is also possible to be deployed over cloud-based environments, such as IaaS (Infrastructure as a Service) platforms. The proposed solution is evaluated by the following three performance metrics: the access response time for ONVIF web services, the video recording interrupt duration due to NVS failure, and the video black out time of the surveillance video monitoring system. The experimental results show that all the metrics are within the acceptable range for a real world video surveillance system.","PeriodicalId":188326,"journal":{"name":"2017 IEEE 7th International Symposium on Cloud and Service Computing (SC2)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824941","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 cloud storage integration services have been developed in recent years that providing a single interface to manage multiple cloud storage accounts across different providers, these cloud storage integration services still remain several issues that do not address. First, because these services do not support arrangement mechanisms for users, they need to keep track of which account they want to upload files to and arrange their storage spaces manually. Second, since each account is divided into different sections, it is impossible to provide a virtual folder that contains files from different cloud storage providers. In addition, when all accounts are nearly full, integration services could not chunk a file to store it across multiple accounts. Third, uploading and moving files across accounts are always done through the integration service's server, which might become a bottleneck when there are a lot of users uploading files at the same time. In this paper, we propose a new cloud storage integration service - Unified Cloud Storage (UCS) for solving the above-mentioned issues, and evaluate its performance by experiments.
{"title":"UCS — A Unified Cloud Storage Integration Service","authors":"Che-Pin Chang, Hsin-Ta Chiao, Yue-Shan Chang, Ching-Tsorng Tsai, Kuo-Kai Yuen, S. Yuan","doi":"10.1109/SC2.2017.45","DOIUrl":"https://doi.org/10.1109/SC2.2017.45","url":null,"abstract":"Although cloud storage integration services have been developed in recent years that providing a single interface to manage multiple cloud storage accounts across different providers, these cloud storage integration services still remain several issues that do not address. First, because these services do not support arrangement mechanisms for users, they need to keep track of which account they want to upload files to and arrange their storage spaces manually. Second, since each account is divided into different sections, it is impossible to provide a virtual folder that contains files from different cloud storage providers. In addition, when all accounts are nearly full, integration services could not chunk a file to store it across multiple accounts. Third, uploading and moving files across accounts are always done through the integration service's server, which might become a bottleneck when there are a lot of users uploading files at the same time. In this paper, we propose a new cloud storage integration service - Unified Cloud Storage (UCS) for solving the above-mentioned issues, and evaluate its performance by experiments.","PeriodicalId":188326,"journal":{"name":"2017 IEEE 7th International Symposium on Cloud and Service Computing (SC2)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116375843","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}
J. Sun, Gwo-jen Hwang, Yu-Yan Lin, Shih-Jou Yu, Liu-Cheng Pan, A. Y. Chen
This study presented a votable concept mapping approach to promoting students' attentional behavior based on the evidence of mining sequential behavioral patterns. Twenty-nine students from an Educational Research Methodology course were recruited as participants. In the first week, a group-polling method was introduced in class; in the second week, participants were asked to draw concept maps using pen and paper (PnP concept mapping); and in the third week, the polling system and concept maps were integrated (votable concept mapping) and applied. The results showed that the votable concept mapping method was effective to stimulating students' attention during class. It was therefore suggested that teachers adopt methods integrating concept maps and polling tools to stimulate students' attention and thereby promote a positive cycle of attentional behavior in the classroom.
{"title":"A Votable Concept Mapping Approach to Promoting Students' Attentional Behavior: Based on the Evidence of Mining Sequential Behavioral Patterns","authors":"J. Sun, Gwo-jen Hwang, Yu-Yan Lin, Shih-Jou Yu, Liu-Cheng Pan, A. Y. Chen","doi":"10.1109/SC2.2017.53","DOIUrl":"https://doi.org/10.1109/SC2.2017.53","url":null,"abstract":"This study presented a votable concept mapping approach to promoting students' attentional behavior based on the evidence of mining sequential behavioral patterns. Twenty-nine students from an Educational Research Methodology course were recruited as participants. In the first week, a group-polling method was introduced in class; in the second week, participants were asked to draw concept maps using pen and paper (PnP concept mapping); and in the third week, the polling system and concept maps were integrated (votable concept mapping) and applied. The results showed that the votable concept mapping method was effective to stimulating students' attention during class. It was therefore suggested that teachers adopt methods integrating concept maps and polling tools to stimulate students' attention and thereby promote a positive cycle of attentional behavior in the classroom.","PeriodicalId":188326,"journal":{"name":"2017 IEEE 7th International Symposium on Cloud and Service Computing (SC2)","volume":"25 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128497401","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
扫码关注我们
求助内容：
应助结果提醒方式：