Tzu-Chi Huang, Kuo-Chih Chu, Jia-Hui Lin, C. Shieh
A MapReduce system gradually becomes a popular platform for developing cloud applications while MapReduce is the de facto standard programming model of the applications. However, a MapReduce system may suffer intermediate data skew to degrade performances because input data is unpredictable and the Map function of the application may generate different quantities of intermediate data according to the application algorithm. A MapReduce system can use the Idempotent Task Cache System (ITCS) proposed in this paper to handle intermediate data skew. A MapReduce system can avoid negative performance impacts of intermediate data skew with ITCS by using caches to skip the high workload of processing skewed intermediate data in certain Reduce tasks. In experiments, a MapReduce system is tested with several popular applications to prove that ITCS not only alleviates performance penalties when intermediate data skew happens, but also greatly outperforms native MapReduce systems without any help of ITCS.
{"title":"Idempotent Task Cache System for Handling Intermediate Data Skew in MapReduce on Cloud Computing","authors":"Tzu-Chi Huang, Kuo-Chih Chu, Jia-Hui Lin, C. Shieh","doi":"10.1109/ICS.2016.0111","DOIUrl":"https://doi.org/10.1109/ICS.2016.0111","url":null,"abstract":"A MapReduce system gradually becomes a popular platform for developing cloud applications while MapReduce is the de facto standard programming model of the applications. However, a MapReduce system may suffer intermediate data skew to degrade performances because input data is unpredictable and the Map function of the application may generate different quantities of intermediate data according to the application algorithm. A MapReduce system can use the Idempotent Task Cache System (ITCS) proposed in this paper to handle intermediate data skew. A MapReduce system can avoid negative performance impacts of intermediate data skew with ITCS by using caches to skip the high workload of processing skewed intermediate data in certain Reduce tasks. In experiments, a MapReduce system is tested with several popular applications to prove that ITCS not only alleviates performance penalties when intermediate data skew happens, but also greatly outperforms native MapReduce systems without any help of ITCS.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122730651","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 development of Internet of Things (IoT) is increasingly emphasized, how to adopt interconnected sensors and devices in conjunction with situation-awareness based system to smarten living applications has paid great attentions. On a multiple-units connected environment, a scheme of event-condition-action (ECA) is frequently used to serve automatic operation functions in the light of defined rules. According to the previous works, the ECA approach was often adopted in IC designs but less applied in advancing human-centered IoT applications, one of the main problems is the difficulty in directly generating ECA rules from human-centered application scenarios. This paper proposes a scenario-triggered, state-based rule generation (shortly S2RG) process which enables a complete but simplified way to conduct ECA rule for human-centered IoT applications. With the operation of the presented S2RG process, this paper also demonstrates ECA rules for two exemplary power saving scenarios for smarter energy applications.
{"title":"Constructing ECA Rule for IoT Application through a Novel S2RG Process: The Exemplary ECA Rules for Smarter Energy Applications","authors":"Yu-Tso Chen, Ching-Chung Chen, Hao-Yun Chang, Hsin-Shan Lin, Hsuan-Ting Chang","doi":"10.1109/ICS.2016.0114","DOIUrl":"https://doi.org/10.1109/ICS.2016.0114","url":null,"abstract":"As the development of Internet of Things (IoT) is increasingly emphasized, how to adopt interconnected sensors and devices in conjunction with situation-awareness based system to smarten living applications has paid great attentions. On a multiple-units connected environment, a scheme of event-condition-action (ECA) is frequently used to serve automatic operation functions in the light of defined rules. According to the previous works, the ECA approach was often adopted in IC designs but less applied in advancing human-centered IoT applications, one of the main problems is the difficulty in directly generating ECA rules from human-centered application scenarios. This paper proposes a scenario-triggered, state-based rule generation (shortly S2RG) process which enables a complete but simplified way to conduct ECA rule for human-centered IoT applications. With the operation of the presented S2RG process, this paper also demonstrates ECA rules for two exemplary power saving scenarios for smarter energy applications.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129533236","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}
Due to the sheer volume of opinion rich web resources such as discussion forum, review sites, blogs, and news corpora available in digital form, much of the current research is focusing on the area of sentiment analysis. People are intended to develop a system that can identify and classify opinion or sentiment as represented in an electronic text. An accurate method for predicting sentiments could enable us, to extract opinions from the internet and predict on-line customer's preferences, which could prove valuable for economic or marketing research. In this paper we present a framework for opinion mining in Traditional Chinese-called FOM (Framework of Opinion Mining) to collect unstructured articles in the popular web site and analyse the opinion and sentiment in the semi-automatic way. The framework is developed by objected oriented design patterns, such as to support the flexibility and maintainability. With the FOM framework, new analysis algorithm can be easily replaced and integrated in a new application. A flood predication application based on facebook text in Taiwan will be demonstrated in this paper.
由于大量的意见丰富的网络资源，如论坛，评论网站，博客和新闻语料库的数字形式，目前的许多研究都集中在情感分析领域。人们打算开发一种系统，可以识别和分类电子文本中所代表的意见或情绪。一种准确的预测情绪的方法可以使我们能够从互联网上提取意见，并预测在线客户的偏好，这对经济或营销研究来说是有价值的。本文提出了一种观点挖掘框架，即FOM (framework of opinion mining)，用于在热门网站中收集非结构化文章，并以半自动的方式分析观点和情感。该框架采用面向对象的设计模式开发，以支持灵活性和可维护性等。利用FOM框架，可以方便地替换和集成新的分析算法。本文将演示一个基于facebook文本的台湾洪水预测应用程序。
{"title":"A Framework for Opinion Mining System with Design Pattern","authors":"Nien-Lin Hsueh","doi":"10.1109/ICS.2016.0128","DOIUrl":"https://doi.org/10.1109/ICS.2016.0128","url":null,"abstract":"Due to the sheer volume of opinion rich web resources such as discussion forum, review sites, blogs, and news corpora available in digital form, much of the current research is focusing on the area of sentiment analysis. People are intended to develop a system that can identify and classify opinion or sentiment as represented in an electronic text. An accurate method for predicting sentiments could enable us, to extract opinions from the internet and predict on-line customer's preferences, which could prove valuable for economic or marketing research. In this paper we present a framework for opinion mining in Traditional Chinese-called FOM (Framework of Opinion Mining) to collect unstructured articles in the popular web site and analyse the opinion and sentiment in the semi-automatic way. The framework is developed by objected oriented design patterns, such as to support the flexibility and maintainability. With the FOM framework, new analysis algorithm can be easily replaced and integrated in a new application. A flood predication application based on facebook text in Taiwan will be demonstrated in this paper.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129024759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The objective of visual cryptography is to hide secret in multiple share images. Then, stacking share images together decrypts hidden secret by human visual system. As the share images are given with different priorities, those share images hide various degrees of secret, which is the objective of progressive visual cryptography. This paper presents a scheme to realize progressive visual cryptography. A 2x2 block is the basic element of share image, and we design block pairs for secret hiding as well as secret encryption. The degrees of hidden secret depend on the priorities of share images. The proposed scheme is capable of decrypting partial secret and inferring the stacked shares. The experiment results will demonstrate that our scheme further achieves applications based on progressive visual cryptography, including self-decryption watermark, and inference of shares stacking.
{"title":"Inference of Share Stacking Based on Progressive Visual Cryptography","authors":"Y. Zeng, Wen-Tsung Chang","doi":"10.1109/ICS.2016.0054","DOIUrl":"https://doi.org/10.1109/ICS.2016.0054","url":null,"abstract":"The objective of visual cryptography is to hide secret in multiple share images. Then, stacking share images together decrypts hidden secret by human visual system. As the share images are given with different priorities, those share images hide various degrees of secret, which is the objective of progressive visual cryptography. This paper presents a scheme to realize progressive visual cryptography. A 2x2 block is the basic element of share image, and we design block pairs for secret hiding as well as secret encryption. The degrees of hidden secret depend on the priorities of share images. The proposed scheme is capable of decrypting partial secret and inferring the stacked shares. The experiment results will demonstrate that our scheme further achieves applications based on progressive visual cryptography, including self-decryption watermark, and inference of shares stacking.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126112854","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 supplies enormous convenience for numerous companies and individuals to manage their data. However, data owners lose ultimately physical control of their data, which introduces many potential safety hazards in the cloud storage environment. Many scholars have made studies on the security problem of cloud storage data. To solve the problem, we propose a secure audit scheme supporting dynamic operation and transparent verification. Utilizing BLS short signature as well as the sequence-enforced B+ Hash Tree structure, the audit scheme is more effective. The scheme introduces an organizer in the auditing process to prevent the TPA from getting any information about the data's location. Thus, the scheme is completely transparent for TPA. Meanwhile, the scheme utilizes random mask and bilinear aggregate signature technology to realize privacy protection and batch audit.
{"title":"An Efficient and Secure Public Batch Auditing Protocol for Dynamic Cloud Storage Data","authors":"Liu Yang, Lili Xia","doi":"10.1109/ICS.2016.0138","DOIUrl":"https://doi.org/10.1109/ICS.2016.0138","url":null,"abstract":"Cloud storage supplies enormous convenience for numerous companies and individuals to manage their data. However, data owners lose ultimately physical control of their data, which introduces many potential safety hazards in the cloud storage environment. Many scholars have made studies on the security problem of cloud storage data. To solve the problem, we propose a secure audit scheme supporting dynamic operation and transparent verification. Utilizing BLS short signature as well as the sequence-enforced B+ Hash Tree structure, the audit scheme is more effective. The scheme introduces an organizer in the auditing process to prevent the TPA from getting any information about the data's location. Thus, the scheme is completely transparent for TPA. Meanwhile, the scheme utilizes random mask and bilinear aggregate signature technology to realize privacy protection and batch audit.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125828744","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 reports a requirements engineering approach to attribute selection for enhancing the results of a recommendation system. A recommendation system suffers the sparsity problem and the cold start problem with collaborative filtering which are caused by the lack of data. Our method is to introduce more timely information of user preferences to enhance the recommendation results that meet the current needs of a user. The proposed method uses a goal-driven approach with the support of the Analytic Hierarchy Process in attribute selection. The experiments show that this method derives promising results.
{"title":"A Goal-Driven Attribute Selection Method for Recommendation Systems","authors":"Ching-Jung Lee, Alan Liu, Po-Hsuan Lu, Power Wu","doi":"10.1109/ICS.2016.0118","DOIUrl":"https://doi.org/10.1109/ICS.2016.0118","url":null,"abstract":"This paper reports a requirements engineering approach to attribute selection for enhancing the results of a recommendation system. A recommendation system suffers the sparsity problem and the cold start problem with collaborative filtering which are caused by the lack of data. Our method is to introduce more timely information of user preferences to enhance the recommendation results that meet the current needs of a user. The proposed method uses a goal-driven approach with the support of the Analytic Hierarchy Process in attribute selection. The experiments show that this method derives promising results.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121629418","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 response to the technological development in recent years, many technology giants are making efforts toward Industry 4.0. However, many small-and medium-sized factories cannot even computerize and automate their factories, which is the foundation of Industry 4.0, due to inadequate capital and scale. This is because the majority of these factories are still using conventional machines in which the data cannot be digitized. Consequently, they cannot achieve the goal of Industry 4.0. This work therefore proposes a simple approach that facilitates the transition of these small-and medium-sized factories. The approach uses add-on triaxial sensors to aid in machine monitoring. The data obtained is analyzed for abnormalities using neural networks. Experiment results demonstrate the validity of the proposed approach.
{"title":"New Method for Industry 4.0 Machine Status Prediction - A Case Study with the Machine of a Spring Factory","authors":"Tzu-Yu Lin, Yo-Ming Chen, Don-Lin Yang, Yi-Chung Chen","doi":"10.1109/ICS.2016.0071","DOIUrl":"https://doi.org/10.1109/ICS.2016.0071","url":null,"abstract":"In response to the technological development in recent years, many technology giants are making efforts toward Industry 4.0. However, many small-and medium-sized factories cannot even computerize and automate their factories, which is the foundation of Industry 4.0, due to inadequate capital and scale. This is because the majority of these factories are still using conventional machines in which the data cannot be digitized. Consequently, they cannot achieve the goal of Industry 4.0. This work therefore proposes a simple approach that facilitates the transition of these small-and medium-sized factories. The approach uses add-on triaxial sensors to aid in machine monitoring. The data obtained is analyzed for abnormalities using neural networks. Experiment results demonstrate the validity of the proposed approach.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124792327","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}
Task ranking and allocation are two major steps in list-based workflow scheduling. This paper explores various possibilities, evaluates recent approaches in the literature, and proposes several new task ranking and allocation heuristics. A series of simulation experiments have been conducted to evaluate the proposed heuristics. Experimental results indicate that effectiveness of task ranking and allocation heuristics largely depends on the characteristics of workflows to be scheduled, and our new scheduling heuristics can outperform previous methods when dealing with workflows of high CCR (Communication-to-Computation Ratio) values.
{"title":"Task Ranking and Allocation Heuristics for Efficient Workflow Schedules","authors":"Kuo-Chan Huang, Meng-Han Tsai","doi":"10.1109/ICS.2016.0108","DOIUrl":"https://doi.org/10.1109/ICS.2016.0108","url":null,"abstract":"Task ranking and allocation are two major steps in list-based workflow scheduling. This paper explores various possibilities, evaluates recent approaches in the literature, and proposes several new task ranking and allocation heuristics. A series of simulation experiments have been conducted to evaluate the proposed heuristics. Experimental results indicate that effectiveness of task ranking and allocation heuristics largely depends on the characteristics of workflows to be scheduled, and our new scheduling heuristics can outperform previous methods when dealing with workflows of high CCR (Communication-to-Computation Ratio) values.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125000198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present a continuous deep learning model for fall detection using Microsoft Kinect. The input include pre-processed high-resolution RGB images, depth images collected by a Kinect and optical flow images. We combine several deep learning structures including convolutional neural networks and long short-term memory networks for continuous human fallen detection. Finally, we present experimental results to demonstrate the performance and utility of our approach.
{"title":"Abnormal Event Detection Using Microsoft Kinect in a Smart Home","authors":"Hsiu-Yu Lin, Yu-Ling Hsueh, W. Lie","doi":"10.1109/ICS.2016.0064","DOIUrl":"https://doi.org/10.1109/ICS.2016.0064","url":null,"abstract":"In this paper, we present a continuous deep learning model for fall detection using Microsoft Kinect. The input include pre-processed high-resolution RGB images, depth images collected by a Kinect and optical flow images. We combine several deep learning structures including convolutional neural networks and long short-term memory networks for continuous human fallen detection. Finally, we present experimental results to demonstrate the performance and utility of our approach.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125018105","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}
An extension to the design domain of problem frames has been proposed. The proposed extension is intended to cope with the inclusion of lexical design domains that have physical counterparts with the equivalent information. An example of the use of such a physical counterpart is illustrated with a spot service application in patient monitoring.
{"title":"Expressing Requirements of Spot Services in Problem Frames: Design Domains as Physical-Lexical Domains","authors":"Chin-Yun Hsieh, Yu Chin Cheng, J. Jwo","doi":"10.1109/ICS.2016.0117","DOIUrl":"https://doi.org/10.1109/ICS.2016.0117","url":null,"abstract":"An extension to the design domain of problem frames has been proposed. The proposed extension is intended to cope with the inclusion of lexical design domains that have physical counterparts with the equivalent information. An example of the use of such a physical counterpart is illustrated with a spot service application in patient monitoring.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122143099","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
扫码关注我们
求助内容：
应助结果提醒方式：