{"title":"Effect of Entropy in Icons and Background on Selection Accuracy","authors":"Kleddao Satcharoen","doi":"10.1109/CCOMS.2018.8463324","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463324","url":null,"abstract":"The purpose of this research is to study the effect of icon and background entropy on selection accuracy under differing cognitive conditions. A series of two experiments are reported here. Both experiments used a 4x2 design (very high/ high/ medium/ low entropy background x high/ low entropy icon), measuring selection accuracy under two different conditions (untimed/3 second timed). The sample included undergraduate students at a university in Thailand (n = 100). Results were analysed using chi-square. The analysis showed that under untimed conditions, there were no significant differences in selection accuracy between different background and icon entropy levels. However, under timed conditions, very high entropy background/high entropy icon selection was significantly lower than other conditions, while low entropy background/low entropy icon selection was higher. This implies that while under normal conditions, visual entropy in field or figure does not impede distinguishing different figures, under conditions of cognitive stress entropy could reduce ability to distinguish such images.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132250789","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}
{"title":"Efficient Pre-Copy Live Migration of Virtual Machines for High Performance Computing in Cloud Computing Environments","authors":"K. Chanchio, Jumpol Yaothanee","doi":"10.1109/CCOMS.2018.8463286","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463286","url":null,"abstract":"Pre-copy live migration is the most popular migration mechanism implemented in most hypervisors. However, it is not suitable for Virtual Machines (VMs) running computation-intensive and memory-intensive workloads because its operational behaviors depend on a configuration parameter, namely the maximum tolerable downtime. Although the default value of this parameter is good enough for normal web-based applications, it is too low for most HPC applications, which are computation-intensive and memoryintensive. Performing a migration with an inappropriate parameter may cause extensively long migration time or downtime. Defining this parameter is nontrivial since application workloads are generally unpredictable. This difficulty also makes it hard for cloud management systems to operate VM live migration automatically. In this paper, we propose the Memory-bound Pre-copy Live Migration (MPLM) mechanism that performs VM live migration without requiring the maximum tolerable downtime parameter. MPLM presents a new perspective of VM live migration, where the migration is performed based on the present state of VM computation without enforcing downtime constraints. During live migration, MPLM separates memory pages into dirty and non-dirty sets and transmits them in a multiplexing manner. MPLM has been implemented in a modified version of the QEMU-KVM software. Experiments have been conducted to evaluate MPLM performances against those of the traditional pre-copy mechanism. We performed a number of live migrations of VMs running four OpenMP NAS Parallel Benchmark programs. Experimental results show that MPLM is more efficient and easier to use than the pre-copy mechanism.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127663453","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}
{"title":"Design and Experiment of NFV-Based Virtualized IP Multimedia Subsystem","authors":"Wei-Kuo Chiang, Juin-Wei Wen","doi":"10.1109/CCOMS.2018.8463235","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463235","url":null,"abstract":"IP multimedia subsystem (IMS) has been recognized as the core control platform for the next generation network (NGN). In this paper, we focus on virtualizing IMS by enabling network function virtualization (NFV). NFV virtualizes network functions into software applications. The virtualized network functions can be decomposed into smaller functional blocks which will enable a high level of elasticity. This paper proposes an NFV-based virtualized IMS (vIMS) architecture that decomposes the S-CSCF into two key functions: one handles the UE registration (registration; R) and the other processes the call control (call control; C). Then the original I-CSCF is combined with the registration function (R), denoted by vI-CSCF(R). The S-CSCF reserves the call control function (C) only, denoted by vS-CSCF(C). We also design the registration procedure and call setup procedure in the vIMS. The vI-CSCF(R) is responsible for the original I-CSCF function and UE registration; thus, the vS-CSCF(C) is offloaded without handling any UE registration message. In addition, we analyze the queuing delay time of registration and call setup in the NFV-based vIMS architecture. Compared with the straightforward solution for IMS virtualization, our proposed vIMS has shorter delay time of registration and call setup by improving the S-CSCF's performance. In order to verify the feasibility of our proposal, we developed and deployed our proposed vIMS and the Clearwater-vIMS with OpenStack and Clearwater software, and run the stress test on them respectively. Compared to the original Clearwater-vIMS, our proposed vIMS have higher registration success rate and call setup success rate.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125136581","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}
{"title":"3D Depth Information Based 2D Low-Complexity Hand Posture and Gesture Recognition Design for Human Computer Interactions","authors":"Ti Chiang, Chih-Peng Fan","doi":"10.1109/CCOMS.2018.8463327","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463327","url":null,"abstract":"Owing to the smart applications of human-computer interaction (HCI), the hand posture and gesture recognition technologies have acquired more and more attentions recently. In this work, the 2D low-complexity hand gesture identification technology is proposed based on 3D depth information. The proposed design overcomes the difficulties to separate the integrated palm region from the complex background. First, the proposed system uses the 3D depth camera to obtain the depth information. Then the system uses the depth image of the palm area to extract the contour and features of hand. By the contour and features of hand from geometric relationship, the proposed design recognizes several useful hand postures and gestures effectively. In our experiments, the recognition accuracy of hand gestures can be up to 98%. By implementing with the 4-core PC (Intel i7−4720, 2.6GHz, 8GB RAM), the average processing speed is up to 15 frames per second.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115962282","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}
Hyun Jun Kim, Ye Seul Son, Yae Eun Kang, Rye Min Park, J. Kim
{"title":"Error Probability Based Resource Allocation for Device-to-Device Communications Underlaying Cellular Networks","authors":"Hyun Jun Kim, Ye Seul Son, Yae Eun Kang, Rye Min Park, J. Kim","doi":"10.1109/CCOMS.2018.8463319","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463319","url":null,"abstract":"In this paper, we propose a new Error Probability based D2D Resource Allocation (EPDRA) scheme to increase the total throughput of cellular networks. In EPDRA, error probabilities of packets, positions of all users, and scheduling information of cellular users (CUEs) are sent to D2D users (DUEs) and are used in DUE pairs to locally decide which resource blocks DUE pairs can use. Finally, simulations are completed using the NS-3 (network simulator). It is shown that the proposed method shows higher total throughput than reference D2D resource allocation schemes.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128971471","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}
Cheng-Hsing Yang, Shang-Shin Liu, Chien-Kai Wang, Shiuh-Jeng Wang
{"title":"Reversible Data Hiding and Image Encryption in Frequency Domain","authors":"Cheng-Hsing Yang, Shang-Shin Liu, Chien-Kai Wang, Shiuh-Jeng Wang","doi":"10.1109/CCOMS.2018.8463302","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463302","url":null,"abstract":"With the increasing popularization of information transmissions in recent years, the Internet has become the primary channel of public communication. However, behind this convenience lie information security risks. Many people have attempted to claim other people's documents as their own via theft or alteration. So information transmission protection and certification have become critical issues. In this study, we used the frequency domain to encrypt and hide certification information. We adopted the wavelet transform method to transform the images from the spatial domain into the frequency domain, used RC4 to perform stream encryptions for the visually sensitive LL area, employed reversible information hiding for the LH, HL, and HH areas using the pixel value ordering (PVO) method and permuted the LH, HL, and HH areas to improve the level of security. Finally, we outputted the file using the ZIP compression format. The results indicated that our method provides a good visual encryption effect by enabling users to correctly extract and remove the certification information as well as certify the decrypted image.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134362449","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}
{"title":"CAMA-UAN: A Context-Aware MAC Scheme to the Underwater Acoustic Sensor Networks for the Improved CACA-UAN","authors":"Xiaodong Liu, Qi Liu","doi":"10.1109/CCOMS.2018.8463242","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463242","url":null,"abstract":"Acoustic Communication is one of the most common and popular techniques used for Underwater Sensor Networks. The design of its communication protocol becomes a challenge due to its features of high delay and low bandwidth. Relevant research work has been conducted on possible communication at the MAC layer for highly efficient allocation and utility of communication channels. In this paper, a communication solution is designed called Context-Aware Mac-layer Approach to Underwater Acoustic Networks (CAMA-UAN), where a competitive mechanism is presented to determine the structure of scheduled MAC frames. According to the results, the CAMA-UAN has shown performance on delay and dropped packet ratio (DPR) when the rearrangement of frame slots is performed.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128236227","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}
Chun-Yen Yeh, Yuh-Ming Cheng, Sheng-Huang, Shi-Jer Lou, E. Zhou
{"title":"Constructing Competence Indicators of Makers for Information and Technology Education in Elementary School","authors":"Chun-Yen Yeh, Yuh-Ming Cheng, Sheng-Huang, Shi-Jer Lou, E. Zhou","doi":"10.1109/CCOMS.2018.8463322","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463322","url":null,"abstract":"Because of the great popularity of the maker movement, the concept of “Do it yourself’ (DIY) has gained considerable public attention. Furthermore, because of the development of rapid prototyping, the rise of open-source hardware and programming languages, the popularization of network communities, and the establishment of maker spaces, DIY has been taken to the next level: “co-creation.” This concept requires reform to the standard curriculum in information and technology education. Therefore, this study aims to define the key competences of makers to construct the competence indicators of Maker Education for information and technology education in elementary school. On this basis, a curriculum can be developed, and an evaluation system for learning effectiveness can be built to equip students with the abilities to adapt to life and tackle challenges. In this study, the Fuzzy Delphi Method (FDM) was applied to collect and analyze data in the form of a questionnaire survey. The subjects were 12 experts from enterprises, governmental institutions, schools and research institutes. The research achievements include 3 factors (“Theoretical knowledge,” “Practical application,” “Maker's mindset”), and 10 indicators.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115263743","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}
M. V. Caya, Jeannell S. Casaje, Gabriel B. Catapang, Regina Amor V. Dandan, N. Linsangan
{"title":"Warning System for Firefighters Using E-Textile","authors":"M. V. Caya, Jeannell S. Casaje, Gabriel B. Catapang, Regina Amor V. Dandan, N. Linsangan","doi":"10.1109/ccoms.2018.8463320","DOIUrl":"https://doi.org/10.1109/ccoms.2018.8463320","url":null,"abstract":"This paper presents a research focused on an e-textile based warning system for firefighters which is intended to bring more safety to firefighters on-the-job. The system is designed so that it is integrated into an undergarment shirt worn underneath a firefighter's protective jacket/suit. It is able to monitor heart rate, detect a firefighter's position relative to his posture, detect CO gas concentrations in the environment and measure ambient temperature. The warning system, as a whole, consists of the sensors and a microcontroller integrated into the undergarment through e-textile technology, and a wireless monitoring device. Measured data are wirelessly transmitted and received by the monitoring device capable of data visualization and are intended to be used by an operation chief to monitor a firefighter. When monitored data exceed a certain threshold value the firefighter will be notified by means of a light and sound alarm. The system performed well when tested against specific digital sensors and withstood moisture exposure tests. Wireless communication was consistently established to the monitoring device.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114697916","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}
{"title":"Analysis and Implementation of APIT Localization Algorithm for Wireless Sensor Network","authors":"Jaya, A. Payal","doi":"10.1109/CCOMS.2018.8463241","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463241","url":null,"abstract":"In the era of big data and loT, Sensor Networks is being explored as a new method of information gathering, processing and dissemination where data is mapped with the location of sensor nodes. Localization is a method where a sensor node has the ability to self-locate the location. Most of the localization algorithms in wireless sensor networks(WSNs) need the location information of reference nodes to localize the unknown nodes. APIT is an anchor based range free localization algorithm which locate the location of unknown node by triangular area method. When the location of the unknown node is near the edge, this algorithm is imprecise. In this paper, an APIT localization algorithm is implemented and analyzed which reduces the localization error by eliminating the edge error effect. The Simulation has been done in MATLAB environment","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122320359","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}