{"title":"The Research of Several Situations About Memory Accessing on Non-Uniform Memory Access Architecture","authors":"Xiaomei Guo, Haiyun Han","doi":"10.1109/ICIS.2018.8466393","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8466393","url":null,"abstract":"In this paper, we have focused our work on memory accesses behavior over a AMD Opteron cache coherent Non-Uniform Memory Access (ccNUMA) platform with multicore processors. We investigated three types memory operations: threads accessing local data, threads not firing at each other and threads firing at each other. When the system was idle and not idle, We compared and analyzed the performance of the three cases and we have the important conclusion about the threads accessing to the memory.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116621030","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":"Pricing Models for Crowdsourcing Tasks Based on Geographic Information","authors":"Yuxin Niu, Yingtao Zhang, M. Song","doi":"10.1109/ICIS.2018.8466433","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8466433","url":null,"abstract":"With the popularity of smart phones and mobile Internet services, crowdsourcing has become a popular business model by which the tasks are published at some crowdsourcing platforms, while the registered members can download the tasks and earn money after finishing the tasks in a distributive manner. This kind of self-service labor crowdsourcing platforms based on mobile Internet provides enterprises with various business inspections and information collection services. During the entire process, how to determine the prices for different tasks is one of key issues of crowdsourcing business. In this paper, we propose three pricing models for crowdsourcing based on geographical information, and then take the Chinese MCM problem B of 2017 as a case study, to give an evaluation on the reasonability and the effectiveness of the proposed pricing models for crowdsourced photography.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"75 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121015396","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}
Hongbin Dong, Hua Zhang, Shuang Han, Xiaohui Li, Xiaowei Wang
{"title":"Reverse-Learning Particle Swarm Optimization Algorithm Based on Niching Technology","authors":"Hongbin Dong, Hua Zhang, Shuang Han, Xiaohui Li, Xiaowei Wang","doi":"10.1109/ICIS.2018.8466391","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8466391","url":null,"abstract":"To solve the precocious and convergence problem, a reverse-learning particle swarm optimization algorithm based on niching technology (NRPSO) was proposed. The algorithm not only retains the historically optimal position of each particle, but also retains the historically worst position of the particle. When the particle has been trapped into a local optimum, the reverse-learning mechanism is adopted. Niche is generated through fuzzy clustering. The simulated annealing method is used inside the niches to guide excellent particles for local mining and learning. The reverse-learning mechanism is adopted between the niches and the particles are guided by the niche territory with low average of fitness to jump out of the local optimum. The experiment results on a set of benchmark functions with different dimensions show that the optimization performance, search efficiency and convergence speed of NRPSO algorithm are much better than other modified PSO algorithm.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115018291","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":"Enhanced Ant Colony Optimization with Local Search","authors":"Yindee Oonsrikaw, A. Thammano","doi":"10.1109/ICIS.2018.8466388","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8466388","url":null,"abstract":"The ant colony optimization (ACO) algorithm frequently gets trapped around local optimum solutions and does not approach the global optimum solution of vehicle routing problem. This work attempts to remedy this drawback by modifying the ant system (AS) algorithm, an instance of ACO. The modification includes a new method of route construction, new weight for improving the pheromone density of each route, and introduction of SA to improve the quality of the solutions from local search. It is called an enhanced ant colony optimization with local search or EACOL. A performance test was performed on EACOL on 10 standard datasets comparing it to those of the ant system algorithm and elitist ant system, and the results show that the proposed algorithm performs better than these two algorithms on these datasets.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115199164","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":"New Words Discovery Method Based On Word Segmentation Result","authors":"Heyang Liu, Pengdong Gao, Yi Xiao","doi":"10.1109/ICIS.2018.8466490","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8466490","url":null,"abstract":"A kind of new words discovery method based on word segmentation result is presented in this paper. Word segmentation is an important part of many Chinese Natural language processing (NLP) tasks. Improving the accuracy of Chinese word segmentation is a matter of great concern. With the increasing number of web text, more and more Chinese NLP tasks need to use micro-blog, movie review and other web text. The content of web text changes very fast and often contains a large number of new words. It is an important factor affecting the accuracy of word segmentation that word segmentation tools can not identify these new words. One way to solve this problem is to discover new words in the text to use and add these new words to the dictionaries on which the word segmentation tool depends. The traditional method of new words discovery can only find the words that do not exist in word segmentation tool’s dictionary. But these words do not necessarily affect the result of the word segmentation. That is, the words may be correctly segmented even if they are not added to the word segmentation tool’s dictionary. To address this issue, we propose to build a collection of candidate new words based on segmentation result. All the new words discovered in this way segmented by the word segmentation tool by mistake. Adding these new words to the word segmentation tool’s dictionary can improve the accuracy of the word segmentation more than traditional methods. Experiments on the DouBan movie review dataset show that our method can get better new words to improve the accuracy on movie review sentiment classification.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115546405","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":"Feasibility of dictionary-based sparse coding for data compression in machine condition-based monitoring","authors":"W. Goh, Nicholas Sadjoli","doi":"10.1109/ICIS.2018.8671663","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8671663","url":null,"abstract":"On-time machine maintenance and upkeep are critical to ensure on-time production. In recent years, Condition-Based Monitoring (CBM) has been regarded as one of the most state-of- the-art machine maintenance techniques that can significantly lower unscheduled maintenance cost and provide greater efficiency. This however means that more data needs to be streamed and stored for CBM to work properly, which might prove costly in the long run in terms of data storage. This paper therefore focuses on the feasibility of using Sparse Coding as a method for signal compression for CBM purposes. Specifically, the feasibility of the method will be measured for vibration signals coming from the spindle component of machines.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129223094","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 Improved Distributed File System Based on GPU Acceleration","authors":"Songtao Shang, Yong Gan, Huaiguang Wu","doi":"10.1109/ICIS.2018.8466439","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8466439","url":null,"abstract":"HDFS is a popular distributed file system, widely used in many commercial fields, which can store TB, even PB level data. Fast data reading and writing is the most important problem for HDFS. However, with the volume of data increasing sharply, the traditional HDFS, built on the PC cluster platform, is no longer suitable for fast data reading and writing. GPU is a highly parallel computing unit. Its power of calculation, reading and writing is hundreds of times as fast as CPU. Hence, this paper proposes an improved distributed file system, which uses GPU as an accelerator. Firstly, the improved HDFS uses GPU instead of CPU response data reading and writing requests. Secondly, the improved HDFS uses GPU’s cache as a buffer memory for data reading and writing. These two strategies significantly improve the performance of the distributed file system. The experimental results have proved the effectiveness of the improved algorithm.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"32 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114102263","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 Model Dynamic Perforation Simulation Based on Game Engine","authors":"Wenfeng Hu, Taobo Gao, Yue Li","doi":"10.1109/ICIS.2018.8466541","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8466541","url":null,"abstract":"3D model cutting is a classic problem in computer graphics. There are many cutting algorithms in the fields of engineering, medicine, architecture, education and games. Perforation is a special cutting problem. In many video games, there are such requirements that 3D game objects are punched at any positions and any angles at running time. This paper purposes a dynamic and efficient perforation algorithm which can apply to the 3D objects in video games.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124330385","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 Analysis of Myanmar Inflectional Morphology Using Finite-state Method","authors":"Tin Myo Latt, A. Thida","doi":"10.1109/ICIS.2018.8466526","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8466526","url":null,"abstract":"This Morphological analysis are essential steps in any Natural Language Processing (NLP) Application. Morphological analysis means taking a word as input and identifying their roots/stems and affixes. It can help in automatic spelling and grammar checking, machine translation, part of speech tagging, and parsing applications. Myanmar language is morphologically rich and it is an inflected language because Myanmar words can be combined to create a new word. This paper presents an analysis of inflection for morphology of Myanmar words. Finite State Automaton (FSA) is used to model for morphological analysis which are based on a set of rules and a monolingual lexicon that contains root words or stem words. It uses the inflectional morphemes to indicate if a word is singular or plural on noun whether it is singular or plural on pronoun, besides it is a positive or comparative or superlative form on adjective and present tense or past tense or future tense on verb.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126268070","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}
Lutfi Hakim, A. Wibawa, Evi Septiana Pane, M. Purnomo
{"title":"Emotion Recognition in Elderly Based on SpO2 and Pulse Rate Signals Using Support Vector Machine","authors":"Lutfi Hakim, A. Wibawa, Evi Septiana Pane, M. Purnomo","doi":"10.1109/ICIS.2018.8466489","DOIUrl":"https://doi.org/10.1109/ICIS.2018.8466489","url":null,"abstract":"Emotion recognition based on physiological signal has become an important issue among researchers nowadays. It is because many studies have proven that emotion condition, especially in elderly, has influenced the physical condition significantly. Nevertheless, there are still few studies which discuss and explores emotion recognition based on SpO2 and Pulse Rate Signals. This paper proposed emotion recognition of three basic emotions of elders, such as happy, sad and angry based on those physiological signals. Window size segmentation that was used to extract both physiological signals was 15 second. Then, statistical feature extraction method was used to obtain the features of SpO2 and Pulse Rate (PR). Support Vector Machine (SVM) with selecting the best of C and γ parameters and the most optimal K parameters of k-Nearest Neighbors (k-NN) method were used to classify the extracted features which were tested in several scenarios: classification using SpO2, using PR and using SpO2–PR features. The result showed that SVM achieved the best accuracy (72.86%) and precision (71.30%) compared to k-NN. Furthermore, combining the features of both physiological signals could improve the accuracy and precision scores more than 3.70% compared to the single physiological signal. This result provides information of emotion recognition in term of SpO2 and PR signals which can be better detected by combining the features of both physiological signals. Moreover, the optimal C and γ parameters of SVM and K-value of k-NN can be implemented to achieve better classification result.","PeriodicalId":447019,"journal":{"name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126313345","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}