{"title":"Network traffic data to ARFF converter for association rules technique of data mining","authors":"Nattawat Khamphakdee, N. Benjamas, Saiyan Saiyod","doi":"10.1109/ICOS.2014.7042635","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042635","url":null,"abstract":"Network traffic data is communication data of user on the network. It is a large data and it also consists of normal and abnormal pattern behavior. The analysis and detection of the abnormal pattern behavior in the network traffic data must spend a long time and very hard to find the intrusion pattern. However, the data mining technology can be utilized to extract normal and abnormal pattern behavior. In addition, an association rules technique is one kind of the data mining technology and it be widely utilized to find a pattern. It can discover the events that frequently occur in these data. In order to find the intrusion pattern, the network traffic data must be converted to the special format for the data mining process. In this paper, we propose the network traffic data to ARFF convertor for the association rules technique of the data mining. We developed the software by using Java language and Weka library. In order to evaluate the performance, we utilized the data set of the MIT-DAPRA 1999 in both week 4th and week 5th. Firstly, we wrote the Snort-IDS rules to detect the data set then record the alert data to mysql database. Secondly, the attributes of the header protocol from snort database will be selected such as tcp, icmp and udp protocol, then save the selected data as .csv file format. Thirdly, the .csv file will be converted to .arff file format by utilizing the Weka library. Finally, we used an apriori algorithm of the association rules mining technique to discover relation of itemsets in the data set. As the experimental result, our application can match the pattern that able to discover the frequent itemsets from the data set then it can generate the association rules which are helpful for computer and network administrator to analyze user behavior. In addition, the attribute of our application can be assigned the number of the attribute in the rule. Thus, the generated rules are able to apply with the intrusion detection system.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123789076","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 novel voting scheme using quantum cryptography","authors":"D. S. Sundar, Nitin Narayan","doi":"10.1109/ICOS.2014.7042411","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042411","url":null,"abstract":"Many problems shadow the traditional method of casting votes. The chief predicament faced is that the voting area is usually politically tense and votes are in the danger of being compromised or coerced while they are stored in each constituency and also when they are being transported to the final tallying destination. We propose a novel method in which votes are not cached in the voting machines but are transferred in real time to a predetermined secure location. To achieve this transfer we propound to use cryptographic methods and proceed to analyze which cryptosystem would be best suited for this application. We introduce our voting scheme which utilizes Quantum Key Distribution (QKD) and propose a novel latency examination technique to detect and thwart man-in-the-middle attacks that might be employed to hack QKD systems. Further we discuss the necessity for post quantum cryptography and research how we might use multivariate public key cryptography for our voting scheme in the post-quantum era.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130354037","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}
Zhiyuan Chen, Le Dinh Van Khoa, A. Nazir, Ee Na Teoh, Ettikan Kandasamy Karupiah
{"title":"Exploration of the effectiveness of expectation maximization algorithm for suspicious transaction detection in anti-money laundering","authors":"Zhiyuan Chen, Le Dinh Van Khoa, A. Nazir, Ee Na Teoh, Ettikan Kandasamy Karupiah","doi":"10.1109/ICOS.2014.7042645","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042645","url":null,"abstract":"Money laundering refers to activities that disguise money receive through illegal operations and make them become legitimate. It leaves serious consequence that may lead to economy corruption. Extensive research has been conducted to investigate proper solution for suspicious transactions detection. In the realm of clustering approaches, traditional research only concentrate on k-means as the best technique so far. On the other hand, although belongs to the same class, there is a lack of studies conducted in employing Expectation Maximization (EM) for Anti-Money Laundering (AML). The objective of this study is to exploit the advantages of EM for suspicious transaction detection. Data used in this study was obtained through a local bank in Malaysia. Subsets of crucial attributes were selected using genetic search and best first search algorithm. Results indicate that critical fields required for clustering phase include amount, number of credit & debit as well as its sum. The outcome of this study shows that EM overwhelmed traditional clustering method k-means for AML in terms of detecting correct suspicious and normal transactions. This lays the groundwork of employing EM in this field. However, further research is needed using different dataset of other banks in order to clarify the effectiveness of EM in AML.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"323 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132494314","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}
A. Abdullah, Kek kok Yong, E. Karuppiah, P. K. Chong
{"title":"Multi keyword range search in GPU and MIC: A comparison study","authors":"A. Abdullah, Kek kok Yong, E. Karuppiah, P. K. Chong","doi":"10.1109/ICOS.2014.7042640","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042640","url":null,"abstract":"Data, both structured and unstructured, is increasing exponentially daily. This valuable data is important to businesses, society, and other organisations in order to compute more accurate analysis, and eventually, make better judgement. In order to handle huge data, many have turned to co-processors like GPUs or Intel MIC to further accelerate their computation. In this study, we present performance and evaluation comparison of GPU and MIC by implementing Multi Text Keyword Search algorithms from our prior work into MIC and GPU. We use NVIDIA K20c and NVIDIA K40 for our GPUs and Intel® Xeon Phi™ 5100 for the MIC. In our experiments and from our observation we found out K20c and K40 outperformed MIC for this particular algorithm.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"144 1-3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114034121","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":"Identification of frequently used features of smartphone web browsers","authors":"Fazal-e-Amin, A. Alghamdi, I. Ahmad","doi":"10.1109/ICOS.2014.7042643","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042643","url":null,"abstract":"Browsing Web through smartphone browsers is gaining popularity due to the convenience and availability of infrastructure at almost all places. On the other hand the capabilities of smartphone browsers are also improved to a great extent and many browsers are available to users. One can perform almost all of his information seeking and Web related tasks through smartphone browser. Many Web sites are customized for the smartphone browsers. This research work is deemed to identify the frequently used smartphone browser features. Mixed methods of research are employed in this study. Qualitative method i.e. interview is used to collect the data from the smartphone users to lay down the basis for quantitative phase i.e. survey. Features are categorized into different categories and two groups i.e. basic, and advanced features. Results show that features related to tabs, view and download are the frequently used by users. The results are equally help for practitioners and researchers to work on the improvement of browser's usability.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122993177","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":"Mobile application development feasibility studies: A case study in Universiti Teknologi MARA","authors":"Dewi Mariati Mahmud, Nur Atiqah Sia Abdullah","doi":"10.1109/ICOS.2014.7042405","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042405","url":null,"abstract":"Mobile application is trendy and receives high demand in marketplace. Thus, mobile technology has been identified as a potential delivery alternative since it is able to provide services anywhere anytime. Basically, most of the university's services are provided through web-based systems, including Universiti Teknologi MARA (UiTM). However, due to the increasing demand from the students and university, mobile application is proposed as an alternative channel for these services. Therefore, the feasibility studies are needed before continuing the mobile requirement engineering and development process. This study aims to delineate the guidelines for mobile application development from feasibility studies in terms of technical aspect and integration issues of web services from the existing systems. A case study in UiTM, which is an alternative mobile service for student portal, is carried out. The feasibility studies in terms of technical aspect are derived in detail and the architecture of the mobile application is examined to get better understanding. Technical aspects include mobile type application, mobile operating system, web services, mobile application architecture are analyzed to be a guideline in any future mobile application development in the future in UiTM.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"176 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120954028","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}
Raseeda Hamzah, N. Jamil, N. Seman, N. Ardi, S. Doraisamy
{"title":"Impact of acoustical voice activity detection on spontaneous filled pause classification","authors":"Raseeda Hamzah, N. Jamil, N. Seman, N. Ardi, S. Doraisamy","doi":"10.1109/ICOS.2014.7042400","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042400","url":null,"abstract":"Filled pause detection is imperative for spontaneous speech recognition as it may degrade speech recognition rate. However, filled pause is commonly confused with elongation as they shared the same acoustical properties. Few attempts of classifying filled pause and elongation employed Hidden Markov model. Our proposed method of utilizing Neural Network as a classifier achieved 96% precision rate. We also proved that voice activity detection (VAD) affects the performance of speech recognition. Three acoustical-based VAD are compared and the best precision rate is achieved by incorporating volume and first-order difference features. Experiments are conducted using Malay language spontaneous speeches of Malaysia Parliamentary Debate sessions.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"99 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128009483","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}
Bushra Naeem, R. Ngah, S. Z. M. Hashim, W. Maqbool
{"title":"Vertical handover decision using history-based communication graph for heterogeneous networks","authors":"Bushra Naeem, R. Ngah, S. Z. M. Hashim, W. Maqbool","doi":"10.1109/ICOS.2014.7042401","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042401","url":null,"abstract":"The implementation of heterogeneous base stations in addition to the traditional macro cell architecture is considered as an additional amenity to existing resources in order to provide a greater capacity and Quality of Service to the mobile users. The future topology of these networks is foreseen as a combination of such networks creating a heterogeneous network. In such a topology, a user will be seamlessly mobile between all available networks and will have to perform a large number of vertical handovers. Due to sensitive timing of handover execution, the ping pong effect may lead to unsuccessful handovers, destroying the purpose of seamless connectivity. This paper presents a new history-based communication graph scheme to perform vertical handover. The proposed scheme has shown a greater number of successful handovers thus reducing the ping pong effect in heterogeneous networks.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133452254","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":"RDF data management for Web2.0 applications","authors":"Noorazida Mohd Idris, S. Z. Abidin","doi":"10.1109/ICOS.2014.7042639","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042639","url":null,"abstract":"Emerging applications such as Web 2.0 and linked data has significantly contributed to the volume of data on the Web. Web 2.0 applications are dynamic in nature, and require frequent and real time update. However, substantial progress in the management of RDF data is focusing on speeding up query processing on the so called static data, such as the linked data. Approaches that are focusing on the static data tend to implement heavy indexing or decomposed techniques that cause updating to be inefficient. Among the RDF store implementations, the big triple table appears to be a robust approach that can be further explored. This paper aims to increase the understanding of the different approaches used in managing the RDF data and discussing the issues in managing Web 2.0 based applications, in order to realize the semantic web vision.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115420305","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}
A. Dastanpour, S. Ibrahim, Reza Mashinchi, A. Selamat
{"title":"Comparison of genetic algorithm optimization on artificial neural network and support vector machine in intrusion detection system","authors":"A. Dastanpour, S. Ibrahim, Reza Mashinchi, A. Selamat","doi":"10.1109/ICOS.2014.7042412","DOIUrl":"https://doi.org/10.1109/ICOS.2014.7042412","url":null,"abstract":"As the technology trend in the recent years uses the systems with network bases, it is crucial to detect them from threats. In this study, the following methods are applied for detecting the network attacks: support vector machine (SVM) classifier, artificial Neural Networks (ANN), and Genetic Algorithms (GA). The objective of this study is to compare the outcomes of GA with SVM and GA with ANN and then comparing the outcomes of GA with SVM and GA with ANN and other algorithms. Knowledge Discovery and Data Mining (KDD CPU99) data set has been used in this paper for obtaining the results.","PeriodicalId":146332,"journal":{"name":"2014 IEEE Conference on Open Systems (ICOS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127048368","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}