{"title":"An evaluation of feature extraction in EEG-based emotion prediction with support vector machines","authors":"Itsara Wichakam, P. Vateekul","doi":"10.1109/JCSSE.2014.6841851","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841851","url":null,"abstract":"Electroencephalograph (EEG) data is a recording of brain electrical activities, which is commonly used in emotion prediction. To obtain promising accuracy, it is important to perform a suitable data preprocessing; however, different works employed different procedures and features. In this paper, we aim to investigate various feature extraction techniques for EEG signals. To obtain the best choice, there are four factors investigated in the experiment: (i) the number of channels, (ii) signal transformation methods, (iii) feature representations, and (iv) feature transformation techniques. Support Vector Machine (SVM) is chosen to be our baseline classifier due to its promising performance. The experiments were conducted on the DEAP benchmark dataset. The results showed that the prediction on EEG signals from 10 channels represented by the band power one-minute features gave the best accuracy and F1.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121775726","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":"Improving arrival time prediction of Thailand's passenger trains using historical travel times","authors":"Suporn Pongnumkul, Thanakij Pechprasarn, Narin Kunaseth, Kornchawal Chaipah","doi":"10.1109/JCSSE.2014.6841886","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841886","url":null,"abstract":"The State Railway of Thailand provides passengers with train location information on their Web site, which includes the name of the last station that each train arrives at or departs from, along with the timestamps and the accumulative train delay (in minutes) from the train timetable. This information allows passengers to intuitively predict the arrival time at their station by adding the last known train delay to the scheduled arrival time. This paper aims at providing a more accurate prediction of passenger train's arrival times using the historical travel times between train stations. Two algorithms that use train location information and historical travel times are proposed and evaluated. The first algorithm uses the moving average of historical travel times. The second algorithm utilizes the travel times of the k-nearest neighbors (k-NN) of the last known arrival time. To evaluate the proposed algorithms, we collected six months of data for three different trains and calculated prediction errors using mean absolute error (MAE). The prediction errors of the proposed algorithms are compared to the prediction errors of the baseline algorithm that predicts the arrival time by adding the last known train delay to the scheduled train arrival time. Both algorithms outperform the baseline prediction. The algorithm based on moving average travel time improves the prediction error by 22.9 percent on average, and the algorithm based on k-NN improves the prediction error by 23.0 percent on average (k=16).","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116771381","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":"Cloud-based data exchange framework for healthcare services","authors":"Tipporn Laohakangvalvit, T. Achalakul","doi":"10.1109/JCSSE.2014.6841874","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841874","url":null,"abstract":"Healthcare is one of the most important basic foundations in every country including Thailand. Using information technology has recently been the trends in healthcare services worldwide. Even though there are many existing hospital information system (HIS) deployed in Thailand, there is no defined standard that aims at supporting a growing demand of information exchange. Currently, healthcare data cannot be shared and exchanged among different healthcare institutes effectively. Moreover, with the increasing in the amount of healthcare data, infrastructure that can handle data processing and storage is in need. Therefore, this paper proposes a framework for data exchange focusing on electronic health record (EHR). In addition, we utilize a cloud computing technology by designing the framework based on the Platform-as-a-Service (PaaS) concept. The framework is designed to be flexible and secured. Any registered software applications can access data exchange services conveniently. In this paper, the suitable EHR data model for healthcare in Thailand, the framework architecture, and the data exchange mechanism are described in details. The practicality of the framework is also verified by the local healthcare experts. We believe that the framework will enable the development of healthcare facility, not only at the level of specific sectors but also over the national level.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126303697","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":"Improving performance of small-file accessing in Hadoop","authors":"Chatuporn Vorapongkitipun, N. Nupairoj","doi":"10.1109/JCSSE.2014.6841867","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841867","url":null,"abstract":"The Hadoop Distributed File System (HDFS) is an open source system which is designed to run on commodity hardware and is suitable for applications that have large data sets (terabytes). As HDFS architecture bases on single master (NameNode) to handle metadata management for multiple slaves (Datanode), NameNode often becomes bottleneck, especially when handling large number of small files. To maximize efficiency, NameNode stores the entire metadata of HDFS in its main memory. With too many small files, NameNode can be running out of memory. In this paper, we propose a mechanism based on Hadoop Archive (HAR), called New Hadoop Archive (NHAR), to improve the memory utilization for metadata and enhance the efficiency of accessing small files in HDFS. In addition, we also extend HAR capabilities to allow additional files to be inserted into the existing archive files. Our experiment results show that our approach can to improve the access efficiencies of small files drastically as it outperforms HAR up to 85.47%.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127725444","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":"Saliency-weighted holistic scene text recognition for unseen place categorization","authors":"Phawis Thammasorn, K. Patanukhom, Rapeeporn Pimup","doi":"10.1109/JCSSE.2014.6841834","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841834","url":null,"abstract":"An improvement in framework for unseen place categorization using scene text is proposed. Category score calculation using visual saliency weighting method is proposed to cope with problem of different importance of word locations on scene images. Additionally, a HOG feature extraction using sliding window is proposed to obtain better holistic word recognition on scene images. As the result, the proposed method outperforms PHOG baseline in unseen place categorization with greater than 10 % improvement in the accuracy.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131438351","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}
P. Upadhyay, S. Ghosh, R. Kar, D. Mandal, S. Ghoshal
{"title":"Low static and dynamic power MTCMOS based 12T SRAM cell for high speed memory system","authors":"P. Upadhyay, S. Ghosh, R. Kar, D. Mandal, S. Ghoshal","doi":"10.1109/JCSSE.2014.6841869","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841869","url":null,"abstract":"This paper focuses on the static and dynamic power dissipations and power delay product of a proposed novel low power MTCMOS based 12T SRAM cell. In the proposed structure two voltage sources are used, one connected with the Bit line and the other one connected with the Bit bar line in order to reduce the swing voltage at the output nodes of the bit and the bit bar lines. Reduction in swing voltage causes the reduction in dynamic power dissipation during switching activity. Because of MTCMOS technology, the SRAM cell is having low VT (LVT) transistors and there are two high VT (HVT) sleep transistors as well. Sleep transistors and a LVT Transmission gate (TG) in conjunction are used for reducing the wake up power during transition from sleep mode to active mode and sleep power during transition from sleep mode to active mode for writing operations of the SRAM cell. This reduces the static power dissipation of the SRAM cell. Simulation results of static and dynamic power dissipations and power delay product of the proposed SRAM cell have been determined and compared to those of some other exiting models of SRAM cell. The proposed SRAM cell dissipates less dynamic power at different frequencies, less static power during transition modes. Simulation has been done in 45nm CMOS environment with the help of Microwind 3.1.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132892526","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":"Volunteered mobile sourcing with multi-objective ant colony optimization","authors":"K. Areekijseree, T. Achalakul","doi":"10.1109/JCSSE.2014.6841875","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841875","url":null,"abstract":"Volunteered computing has been one of the popular distributed computing concepts recently. The basic idea is to allow computer owners to donate the computing power and storage to scientific applications. In this research, we are interested in the utilization of volunteered mobile devices. The implementation of such a concept is complicated since it is hard to accurately estimate the execution time of workflow tasks on numerous mobile devices. To efficiently schedule application workflows can thus be a real challenge. In this paper, we proposed a practical way to construct a workflow with estimated overhead and execution time, as well as a scheduling algorithm for a highly distributed computing platform. The main idea is to effectively optimize task scheduling onto the currently available mobile devices with two objectives of maximizing both cost and execution time saved. Therefore, the cost will be covered by the volunteers. We adapt the Multi-objective Ant Colony Optimization (MOACO) algorithm in our framework. We perform an experiment with different sizes of scientific workflows under different numbers of volunteered devices. The results show a good potential in using mobile sources to minimize the energy consumption at the data center while keeping the execution time within a reasonable deadline.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131099760","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":"Scaling Hadoop clusters with virtualized volunteer computing environment","authors":"E. Kijsipongse, S. U-ruekolan","doi":"10.1109/JCSSE.2014.6841858","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841858","url":null,"abstract":"MapReduce framework has commonly been used to perform large-scale data processing, such as social network analysis, data mining as well as machine learning, on cluster computers. However, building a large dedicated cluster for MapReduce is not cost effective if the system is underutilized. To speedup the MapReduce computation with low cost, the computing resources donated from idle desktop/notebook computers in an organization become true potential. The MapReduce framework is then implemented into Volunteer Computing environment to allow such data processing tasks to be carried out on the unused computers. Virtualization technology is deployed to resolve the security and heterogeneity problem in Volunteer Computing so that the MapReduce jobs can always run under a unified runtime and isolated environment. This paper presents a Hadoop cluster that can be scaled into virtualized Volunteer Computing environment. The system consists of a small fixed set of dedicate nodes plus a variable number of volatile volunteer nodes which give additional computing power to the cluster. To this end, we consolidate Apache Hadoop, the most popular MapReduce implementation, with the virtualized BOINC platform. We evaluate the proposed system on our testbed with MapReduce benchmark that represents different workload patterns. The performance of the Hadoop cluster is measured when its computing capability is expanded with volunteer nodes. The results show that the system can be scaled preferably for CPU-intensive jobs, as opposed to data-intensive jobs which their scalability is more restricted.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128977020","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. Ketcham, Thittaporn Ganokratanaa, Sriphagaarucht Srinhichaarnun
{"title":"The intruder detection system for rapid transit using CCTV surveillance based on histogram shapes","authors":"M. Ketcham, Thittaporn Ganokratanaa, Sriphagaarucht Srinhichaarnun","doi":"10.1109/JCSSE.2014.6841832","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841832","url":null,"abstract":"This paper presents the intruder detection system for rapid transit using CCTV surveillance based on the histogram shapes. In this paper, researchers proposed intruder detection algorithm of yellow line located on the ground next to rapid transit railway for preventing passengers from any harmful train incidents by using CCTV surveillance system based histogram shape that is incredibly convenient technique for image analysis. The histogram shapes of trespass and non-trespass are different. Therefore, it can be used to alarm as a warning system to the passengers who invade the yellow line. The good advantages of the histogram shapes method are; flexibility in use and stability in light changing. This research is suitable for CCTV surveillance system used in observation mode for intruder detection. The system can be worked both on real time and offline mode. The experimental results show the error of the system that is less than 5%.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"386 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129634494","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}