The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)最新文献

筛选
英文 中文
Towards a new design of firewall: Anomaly elimination and fast verifying of firewall rules 一种新的防火墙设计:异常消除和防火墙规则的快速验证
Suchart Khummanee, Atipong Khumseela, S. Puangpronpitag
{"title":"Towards a new design of firewall: Anomaly elimination and fast verifying of firewall rules","authors":"Suchart Khummanee, Atipong Khumseela, S. Puangpronpitag","doi":"10.1109/JCSSE.2013.6567326","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567326","url":null,"abstract":"Network security is usually protected by a firewall, which checks in-out packets against a set of defined policies or rules. Hence, the overall performance of the firewall generally depends on its rule management. For example, the performance can be decreased when there are firewall rule anomalies. The anomalies may happen when two sets of firewall rules are overlapped or their decision parts are both an acceptance and a denial simultaneously. In this paper, we propose a new paradigm of the firewall design, consisting of two parts: (1) Single Domain Decision firewall (SDD) -a new firewall rule management policy that is certainly not conflicts, and (2) the Binary Tree Firewall (BTF) -a data structure and an algorithm to fast check the firewall rules. Experimental results have indicated that the new design can fix conflicting anomaly and increase the speed of firewall rule checking from O(N2) to O(log2 N).","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122418982","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}
引用次数: 21
RapidMiner framework for manufacturing data analysis on the cloud RapidMiner框架,用于云上的制造数据分析
Nopparoot Kitcharoen, Sasithorn Kamolsantisuk, Reenapat Angsomboon, T. Achalakul
{"title":"RapidMiner framework for manufacturing data analysis on the cloud","authors":"Nopparoot Kitcharoen, Sasithorn Kamolsantisuk, Reenapat Angsomboon, T. Achalakul","doi":"10.1109/JCSSE.2013.6567336","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567336","url":null,"abstract":"This research proposes a manufacturing data analysis framework in the form of computing blocks. The aim is to identify the parameters/attributes that affect the production yield as well as the root cause of the manufacturing problems. The framework is designed to be flexible and exploit the cloud as a computing platform. The manufacturing data are obtained from the database of the production lines in the food industry and pre-processed. Then, the correlation analysis and the decision tree algorithm are applied. The root cause parameters of yield degradation are identified in the form of decision rules. In addition, the analysis framework is built based on the workflow concept where several computing blocks can be linked together to form a workflow graph. Each computing block can be tailored made to fit the food manufacturing data. RapidMiner, a GUI-based tool for data mining, is selected as the workflow engine. The designed statistical analysis modules are then built as plugged-ins to RapidMiner. To construct a workflow, the plant engineers can use basic data mining modules as well as our custom designed ones. Moreover, RapidAnalytics is customized to allow the computing blocks to be scheduled onto the private cloud. The designed framework is thus flexible and suitable for agile manufacturing process in Thailand's food industry.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594781","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}
引用次数: 14
Using association rules to identify root causes of CRD in broilers 利用关联规则识别肉鸡CRD的根本原因
S. Maneewongvatana, S. Maneewongvatana, Tanate Lojitamnuay, Mallika Juthasong
{"title":"Using association rules to identify root causes of CRD in broilers","authors":"S. Maneewongvatana, S. Maneewongvatana, Tanate Lojitamnuay, Mallika Juthasong","doi":"10.1109/JCSSE.2013.6567346","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567346","url":null,"abstract":"Chronic Respiratory Disease (CRD) in broilers poses some management challenges for the poultry meat industry since the disease discovery often comes too late. Raw meat from infected chickens must be excluded from being processed into cooked poultry product. Many factors from raising process are considered to contribute to such disease. Thus, finding root causes of CRD would help the farmers to have better control and prevent disease and also help the processing facilities to have a better estimation of raw meat amount. In this paper, we apply associate rules technique to identify the root causes of CRD. Possible factors were first identified by skilled veterinarians. Then collected data from several farms were used to find sets of factors that could potentially be the root causes. From the results we can identify set of general factors that are common root causes on all farms as well as sets of farm-dependent factors.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123847085","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}
引用次数: 2
Improving performance of a mobile personalized recommendation engine using multithreading 使用多线程改进移动个性化推荐引擎的性能
Komkid Chatcharaporn, J. Angskun, T. Angskun
{"title":"Improving performance of a mobile personalized recommendation engine using multithreading","authors":"Komkid Chatcharaporn, J. Angskun, T. Angskun","doi":"10.1109/JCSSE.2013.6567338","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567338","url":null,"abstract":"Popularity of social networking services (SNS) and location-based SNS (LBSNS) have an influence on lifestyles of many people. Furthermore, the advancement of mobile technology enables people to share their interests and lifestyles to their friends conveniently. These factors cause the Internet to become massive personal information resource. A mobile personalized recommendation (MPR) engine plays an important role in offering solely essential information to prevent information overload for the users. Unfortunately, processing time of traditional MPR engine is high. This paper proposes an approach to improve performance of MPR using multithread programming (MP). The experimental results indicate that the multithread programming (MP) could deliver higher performance than sequential programming (SP), especially speedup between 5 and 7 times approximately.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115517310","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}
引用次数: 2
An Open Monitoring Environment for primary school children engaged in tablet-based learning 面向小学生平板电脑学习的开放式监测环境
A. Harfield, I. Jormanainen, Jaratsri Rungrattanaubol, Ratchada Pattaranit
{"title":"An Open Monitoring Environment for primary school children engaged in tablet-based learning","authors":"A. Harfield, I. Jormanainen, Jaratsri Rungrattanaubol, Ratchada Pattaranit","doi":"10.1109/JCSSE.2013.6567344","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567344","url":null,"abstract":"The current trend of tablet computers as learning tools in the classroom places extra demands on the teacher. Learning environments are needed which enable the teacher to monitor the progress of their students and to receive alerts when particular students are encountering difficulties. In this paper we develop a support environment for teachers using tablets in primary school first year education. The environment is based on existing research into an Open Monitoring Environment that enables the teacher to explore and elaborate a model of student progress. Using the data collected from science activities on tablets in a Thai school, the developed system offers teachers insight into the state of the learning progress of students. An example visualisation is provided that can help the teacher to explore which students are progressing well and which students are having difficulty. Furthermore, the unique quality of the environment is in its flexibility to extend the model with new visualisations or metrics in order to better understand the learning activity.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123984819","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}
引用次数: 7
Experimental framework for searching large RDF on GPUs based on key-value storage 基于键值存储的gpu上大型RDF搜索实验框架
Chidchanok Choksuchat, C. Chantrapornchai
{"title":"Experimental framework for searching large RDF on GPUs based on key-value storage","authors":"Chidchanok Choksuchat, C. Chantrapornchai","doi":"10.1109/JCSSE.2013.6567340","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567340","url":null,"abstract":"Resource Description Framework (RDF) is commonly used for the semantic web query. During this decade, due to big data processing, the large numbers of RDF triples are crawled. The triples usually stored distributed on the clouds storage or the large clusters. To search for the query answer, it is usually difficult to handle the search across platforms. Also, the search takes a long executed time. Thus, the data representation and platform are important to speedup the search and handle the heterogeneousness. In this paper, we present the experimental framework which can be used to handle the search of RDF data in GPU clusters. Our framework uses the Java platform to manipulate the semantic query while using JCuda1 to perform the GPU processing. Apache Cassandra storage, known as CumulusRDF, is used to store key-values for searching. In the experiments, DBpedia and Freebase dataset are extracted and manipulated. The triple structures are transformed and loaded into Apache Cassandra storage as CumulusRDF's flat layout. The subject-predicate-object keys are kept in CQL caching. There are about 3-hundred-million tags that can be handled with in one machine, which can reduce time, with an inexpensive cost. We shape the data grid from row-major-ordering of Java, to GPU thread grid of CUDA, retrieved keys to join for finding the correspondence of the RDF graph.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127077575","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}
引用次数: 3
An implementation of a multi-site virtual cluster cloud 一个多站点虚拟集群云的实现
Pongsakorn U-chupala, P. Uthayopas, Koheix Ichikawa, S. Date, H. Abe
{"title":"An implementation of a multi-site virtual cluster cloud","authors":"Pongsakorn U-chupala, P. Uthayopas, Koheix Ichikawa, S. Date, H. Abe","doi":"10.1109/JCSSE.2013.6567337","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567337","url":null,"abstract":"The use of virtual cluster for High Performance Computing (HPC) work has a great benefit of hiding the complexity of physical infrastructure while providing a familiar HPC environment for users. Nevertheless, setting up one is still a challenging task for most users. In addition, the ability to span a virtual cluster across a multi-site cloud can even create a great potential for users to harness a much higher processing power from the cloud. In this paper, the development of a multi-site virtual cluster cloud is presented. This is done by providing the cloud infrastructures tailored specifically for virtual cluster deployment along with related utilities such as web-interface monitor and command line tools. To realize this infrastructure, an overlay network is created using Virtual Private Network (VPN) technology to merge every site into a single broadcast domain. Moreover, a Multi-tier VPN network topology is proposed to enhance the communication performance among the multi-site cloud. A smart virtual machine scheduling mechanism is introduced to reduce performance degradation caused by network delays. The experimental results show that the virtual cluster works well with highly parallel task with low communication among task. Thus, this technology can be used to support many classes of important HPC applications.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125428751","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}
引用次数: 9
Message dropping policy in congested social Delay Tolerant Networks 拥塞社会容忍延迟网络中的消息丢弃策略
Tossaphol Settawatcharawanit, S. Yamada, M. Haque, K. Rojviboonchai
{"title":"Message dropping policy in congested social Delay Tolerant Networks","authors":"Tossaphol Settawatcharawanit, S. Yamada, M. Haque, K. Rojviboonchai","doi":"10.1109/JCSSE.2013.6567330","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567330","url":null,"abstract":"Congestion in DTNs happens when the forwarding path to destination does not exist and a node runs out of buffer space. Several works have shown that the situation is hard to mitigate. Consequently, to choose the right message to drop is a crucial task. Moreover, there has not been much attention to the buffer management policy in the Social-DTNs contexts. Therefore, an efficient buffer management policy for Social-DTNs is needed to achieve a better performance for communication in challenging disruptive scenarios. In this paper, we propose a novel message dropping policy for Social-DTNs. Our proposed policy utilizes social relation of nodes to avoid dropping meaningful messages in congested social-DTNs. We have implemented and evaluated our policy on the ONE simulator, and used real contact traces obtained during a conference. Our evaluation results show that our proposed policy can significantly reduce the number of overhead and can outperform the traditional policy under investigated scenarios.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123049146","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}
引用次数: 9
Detection of wordplay generated by reproduction of letters in social media texts 社交媒体文本中字母复制产生的文字游戏检测
P. Hirankan, A. Suchato, P. Punyabukkana
{"title":"Detection of wordplay generated by reproduction of letters in social media texts","authors":"P. Hirankan, A. Suchato, P. Punyabukkana","doi":"10.1109/JCSSE.2013.6567310","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567310","url":null,"abstract":"Wordplay generated by letters of its original word being repeated is commonly found in social network texts. Most of the time, wordplay items of this type are ambiguous to machines in language processing tasks such as Text-to-Speech. This paper shows some statistics on the number of letters from 102,586 real social network text items and proposes a set of classification features together with a few classification frameworks to detect repeated-letter wordplay tokens from Thai social network texts, which were tokenized by CRF-based Thai word segmentation. Evaluation on 48,949 text items shows that the proposed method achieves the detection accuracy of 98.45% which is an improvement over simple rule-based and some previously proposed methods.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122631743","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}
引用次数: 4
Expertise ranking in question-answer social network groups 在问答社交网络群体中的专业知识排名
Chokchai Puttan, T. Senivongse
{"title":"Expertise ranking in question-answer social network groups","authors":"Chokchai Puttan, T. Senivongse","doi":"10.1109/JCSSE.2013.6567341","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567341","url":null,"abstract":"Online social networks have become the major channel for people to maintain relationships, collaborate, and contribute shared information. A social network group can be created as a specific community for people who share an interest in a particular topic. One form of interaction within the group is the question-answer interaction by which the users in the group can ask questions or provide answers to others. A network analysis method, e.g., PageRank, can be used to analyze the interaction patterns between the users in order to identify and rank experts in the group. In this paper, we are interested in experimenting on how the quality of the users' comments can take part in the identification and ranking of experts by a PageRank-like algorithm. The quality factors are community rating, that is given to the answers, and the content-based features of the comments, i.e., length, complexity, and informativeness. We conduct an experiment on a Java Facebook group and evaluate the accuracy of the ranking with and without comment quality consideration against expertise ranking by Java experts.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122355515","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}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信