{"title":"Integrating a Middleware DDS Application for Safety Purposes in an Underground Railway Environment","authors":"S. Hadiwardoyo, Liuhua Gao","doi":"10.1109/CCOMS.2018.8463334","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463334","url":null,"abstract":"In an underground transportation environment, the communication system can have regular disruptions when a train that transport information is moving from one station to another. Middleware DDS (Data Distribution Service) that offers QoS (Quality of Service) can be a solution to keep the information circulated on the network. In applications like surveillance system to monitor passenger's movements, DDS can keep data captured from video files using IP cameras distributed in the network regardless the cuts of communications that occur. When an inter-station phase occurs, the exchanged data between train wagons and train stations when the train stops can still be kept even though the train is disconnected from the global networks. This information is still circulated among different producer/consumer embedded in the wagon. This paper presents a successful illustration in simulation environment of video file exchange between IP cameras that intends to extract passenger's information using DDS Middleware.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133937080","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":"A Matrix Decomposition Method for Odd-Type Gaussian Normal Basis Multiplication","authors":"Kittiphon Phalakarn, A. Surarerks","doi":"10.1109/CCOMS.2018.8463251","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463251","url":null,"abstract":"Normal basis is used in many applications because of the efficiency of the implementation. However, most space complexity reduction techniques for binary field multiplier are applicable for only optimal normal basis or Gaussian normal basis of even type. There are 187 binary fields GF 2k for k from 2 to 1,000 that use odd-type Gaussian normal basis. This paper presents a method to reduce the space complexity of odd-type Gaussian normal basis multipliers over binary field GF 2k. The idea is adapted from the matrix decomposition method for optimal normal basis. The result shows that our space complexity reduction method can reduce the number of XOR gates used in the implementation comparing to previous works with a small trade-off in critical path delay.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129014110","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":"An Efficient Hash Based Parallel Block Cipher Mode of Operation","authors":"Aqeel Sahi, D. Lai, Yan Li","doi":"10.1109/CCOMS.2018.8463342","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463342","url":null,"abstract":"Block cipher encryption works on fixed length blocks, usually 128bits. The blocks of data are transformed into encrypted data blocks of identical size using a shared session key. A common feature of some modes of block cipher, such as Cipher Block Chaining mode (CBC), Cipher Feedback mode (CFB), Output Feedback mode (OFB), is the sequential processing. The ciphering process of a block cannot begin until the processing of the preceding block is completed. This feature does not make full use of the processing power in multiple processor systems. In this paper, we proposed a Parallel Block Cipher (PBC) mode, in which blocks of cipher can be processed in parallel. Results of speed performance tests of the PBC mode using various settings are presented and compared with the standard CBC mode. The PBC mode was shown to save 60% of execution time when compared with the CBC mode. Furthermore, the hash value of the data file might be utilized to provide integrity check in addition to encryption using AES128. As a result, the PBC mode has a better speed performance on top of the confidentiality and security provided by the CBC mode.","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-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129653401","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 Implementation of a Shared Multi-tiered Storage System","authors":"Hsung-Pin Chang, Yu-Cheng Yu, Pei-Yao Chung","doi":"10.1109/CCOMS.2018.8463233","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463233","url":null,"abstract":"In recent decades, cloud-based shared storage services create a promising solution for data store. In addition, flash-based solid-state drives (SSDs) have been widely deployed in the storage systems, especially as caches, to boost I/O performance. In a shared storage, performance isolation is critical since misbehaving or high-demand tenants can overuse the storage resource, leading to unfair performance to other well-behaving tenants. However, how to achieve performance isolation in multi-tiered storage systems has not been well addressed. Thus, in this paper, we address the interference problems in shared multi-tiered storage environments, and propose a framework to realize performance isolation in shared multi-tiered storage systems. The experimental results show our proposed framework is effective in realizing the multi-tiered-based shared storage systems in cloud computing environments. With PIMS, interference in a multi-tiered storage can be eliminated and performance isolation can be ensured.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126496237","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":"Optimizing Field-Aware Factorization Machine with Particle Swarm Optimization on Online Ads Click-through Rate Prediction","authors":"M. R. Phangtriastu, S. M. Isa","doi":"10.1109/CCOMS.2018.8463219","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463219","url":null,"abstract":"Online advertising industry is grow larger along with the increasing numbers of internet users. To make ads industry to be more efficient, prediction model for ads' click-through rate is needed. In this research, Field-aware Factorization Machine (FFM) is going to be optimized using Particle Swarm Optimization (PSO) on FFM parameters to increase the accuracy of the FFM. In this research, FFM and PSO-FFM is compared with accuracy and execution time. Our experimental results show PSO can increase FFM performance.","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-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130667292","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":"Cooperative Online Caching in Small Cell Networks with Limited Cache Size and Unknown Content Popularity","authors":"Chen-Tai Yen, Feng-Tsun Chien, Min-Kuan Chang","doi":"10.1109/CCOMS.2018.8463254","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463254","url":null,"abstract":"In this paper, we study delay-aware cooperative online content caching with limited caching space and unknown content popularity in dense small cell wireless networks. We propose a Cooperative Online Content cAching algorithm (COCA) that decides in which BS the requested content should be cached with considerations of three important factors: the residual cache space in each small cell basestation (SBS), the number of coordinated connections each SBS establishes with other SBSs, and the number of served users in the coverage area of each SBS. In addition, due to limited storage space in the cache, the proposed COCA algorithm eliminates the least recently used (LRU) contents to free up the space. We compare the delay performance of the proposed COCA algorithm with the existing offline cooperative caching schemes through simulations. Simulation results demonstrate that the proposed COCA algorithm has a better delay performance than the existing offline algorithms.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123200143","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}
Chaiwat Chaweewan, A. Surarerks, A. Rungsawang, Bundit Manaskasernsak
{"title":"Development of Programming Capability Framework Based on Aptitude and Skill","authors":"Chaiwat Chaweewan, A. Surarerks, A. Rungsawang, Bundit Manaskasernsak","doi":"10.1109/CCOMS.2018.8463269","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463269","url":null,"abstract":"This paper presents overall study and proposes a framework of aptitude and skill evaluation for the first-year engineering students in a computer programming class. The research framework has been designed to study coding style and programming skill evaluation through determination of the outputs from the grader system such as time consumption, scores and other additional information. A student's submitted program is investigated to identify his style by using the readability score from readability module to find the difficulty level of a readable program source code. Resulting data from user information extraction and source code analysis has been collected to create a user profile. This user profile can describe style, aptitude and skill of a student when solving a problem by using a programming language and enable to diagnose the problem-solving trend of that student on problems in the future. The disclosed information is very important to evaluate the programming capabilities of each student and to show their programming behavior in order to provide information to the instructor to improve their students' programming skill.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"77 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132026110","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}
Preaw Wongsaree, Sakkarin Sinchai, P. Wardkein, J. Koseeyaporn
{"title":"Distance Detection Technique Using Enhancing Inverse Perspective Mapping","authors":"Preaw Wongsaree, Sakkarin Sinchai, P. Wardkein, J. Koseeyaporn","doi":"10.1109/CCOMS.2018.8463318","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463318","url":null,"abstract":"This paper presents a distance determination technique using an image from the single forward camera. Since too dark or too bright of the image and non-linear relation between height of the object and distance from the camera have effect on the performance of the detection process. Therefore, automatic brightness adjustment and inverse perspective mapping (IMP) is applied in the proposed scheme. In addition, region of interest (ROI) determination is used to decrease the processing time. The experimental results confirm that the proposed technique can detect distance of the object in front of the car where the error is 7.96%.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"35 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":"114279589","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":"Capacity Analysis of Frequency Shift Based Backscatter Communication System","authors":"Jiamei Wei, Xiaohua Tian","doi":"10.1109/CCOMS.2018.8463325","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463325","url":null,"abstract":"Ambient backscatter is a new communication technology that enables connectivity between battery-free devices and off the shelf devices. To cancel self-interference from the wireless carrier signal without specific hardware, backscatter systems usually adopt to shift the carrier signal to another frequency band and keep the backscattered signals away from primary carrier signal. In this paper, we analyze the effect of frequency shift size on system capacity. We also build prototype backscatter system, consisting of a FPGA facilitated backscatter tag and WARP board as the transmitter. We conduct experiments with various frequency shift step sizes, and measure the PER of the tag under different experimental conditions. It is found that at most two concurrent tags can be supported in the 802.11b based backscatter communication systems when the carrier signal occupied one channel.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"36 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":"121852976","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":"Assessment of Weight Perception with Haptics in Networked Virtual Environment","authors":"D. Osada, Y. Ishibashi, Pingguo Huang, Y. Tateiwa","doi":"10.1109/CCOMS.2018.8463266","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463266","url":null,"abstract":"In this paper, we assesse influences of weight change on human perception of weight in a networked virtual environment. In our assessment, each subject has one end of a bar with a weight in a three-dimensional (3D) virtual space by using a haptic interface device, and the subject answers whether the weight has been changed or not when the weight is changed. Assessment results show that all the subjects can hardly perceive weight changes less than or equal to about 10 gf.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"23 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":"134634765","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}