{"title":"A Secured OpenFlow-Based Switch Architecture","authors":"Bao Ho, C. Pham-Quoc, T. N. Thinh, N. Thoai","doi":"10.1109/ACOMP.2016.021","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.021","url":null,"abstract":"In this paper, we propose a secured OpenFlow-based switch architecture. The architecture is a combination of OpenFlow Processing that routes packets according to the OpenFlow protocol and Security Processing that defends against network attacks. Therefore, the proposed switch can work not only as a OpenFlow-based forwarding device but also as a network protection system. We implement our prototype switch on a Xilinx Virtex 5 xc5vtx240t FPGA device. In this prototype version, we integrate two different DDoS countermeasure techniques, the Hop-Count filtering and Port Ingress/Egress filtering. The experimental results show that the switch achieves packet processing throughput by up to 19.7 Gbps while a 100% DDoS detection rate with up to a 2.9% false positive rate and a 0% false negative rate is obtained. Our prototype system uses up to 36% Look-Up Tables, 38% Registers, and 62% Block RAM of the FPGA device.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131149180","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 Technique for Generating Test Data Using Genetic Algorithm","authors":"Dinh Ngoc Thi, Vo Dinh Hieu, Nguyen Viet Ha","doi":"10.1109/ACOMP.2016.019","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.019","url":null,"abstract":"Automatic test data generation for path coverage is an undecidable problem and genetic algorithm (GA) has been used as one good solution. This paper presents a method for optimizing GA efficiency by identifying the most critical path clusters in a program under test. We do this by using the static program analysis to find all the paths having the path conditions with low probability in generating coverage data, then basing on these path conditions to adjust the procedure of generating new populations in GA. The proposed approach is also applied some program under tests. Experimental results show that improved GA which can generate suitable test data has higher path coverage than the traditional GA.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"887 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116262959","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}
T. K. Dang, Duc Dan Ho, D. Pham, An Khuong Vo, H. Nguyen
{"title":"A Cross-Checking Based Method for Fraudulent Detection on E-Commercial Crawling Data","authors":"T. K. Dang, Duc Dan Ho, D. Pham, An Khuong Vo, H. Nguyen","doi":"10.1109/ACOMP.2016.015","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.015","url":null,"abstract":"Marketing research through collecting data from e-commercial websites comes with latent risks of receiving inaccurate data which have been modified before they are returned, especially when the crawling processes are conducted by other service providers. The risk of data being modified is often dismissed in related research works of web crawling systems. Avoiding this problem requires an examination phase where the data are collected for the second time for comparisons. However, the cost for re-crawling processes to simply examine all the data is significant as it will double the original cost. In this paper, we introduce an efficient approach to choose potential data which are most likely to have been modified for later re-crawling processes. By this approach, we can reduce the cost for examining, but still guarantee the data achieve their authenticity. We then measure the efficiency of our scheme while testing the ability to detect fraudulent data in a dataset containing simulated modified data. Results show that our scheme can reduce considerably the amount of data to be re-crawled but still cover most of the fraudulent data. As an example, by applying our scheme to select the data to be re-crawled from a real-world e-commercial website, with a set in which fraudulent data occupy 50 percentages, we only need to re-collect 50 percentages of total data to detect up to 80 percentages of fraudulent data, which is clearly more efficient than choosing randomly the same amount of data to be re-crawled. We conclude by discussing the accuracy measurement of the proposed model.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126967787","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. Chung, An Le, Nguyen Quang-Hung, Duc D. Nguyen, N. Thoai
{"title":"Provision of Docker and InfiniBand in High Performance Computing","authors":"M. Chung, An Le, Nguyen Quang-Hung, Duc D. Nguyen, N. Thoai","doi":"10.1109/ACOMP.2016.027","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.027","url":null,"abstract":"High Performance Computing (HPC) is playing an important role in a variety of domains with the demand of high-level computational capacity. Besides, HPC provides services for a huge range of different users as well as multiple environments. Hence, the performance of the network is also one of the important criteria. The advent of InfiniBand (IB) aims at the improvement of computer-networking. IB technology has been used and expanded on virtualization environments, especially in virtual machines (VMs). Recently, another virtualization technique known as Docker platform is being popularly considered. Docker promises to bring higher performance, but it also poses some challenging problems. Concretely, while VMs are combined with IB by standard virtualization modules such as SR-IOV, Docker containers are still being examined on feasible solutions with IB. An important question is the advantages and disadvantages of both architectures, namely VM and Docker. In this paper, we deploy Docker on IB infrastructure and evaluate their performance with VMs. Remarkably, we highlight the benefits and the drawbacks of Docker in the conflict of resources when its architecture shares the same kernel with the host. Our evaluations emphasize the potential of Docker containers in HPC field, simultaneously, we propose experiences when using Docker for running parallel applications.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129561939","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}
Tam Chi Nguyen, L. Pham, H. M. Nguyen, Bao Bui, D. Ngo, Trang Hoang
{"title":"A High Performance Dynamic ASIC-Based Audio Signal Feature Extraction (MFCC)","authors":"Tam Chi Nguyen, L. Pham, H. M. Nguyen, Bao Bui, D. Ngo, Trang Hoang","doi":"10.1109/ACOMP.2016.025","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.025","url":null,"abstract":"State-of-the-art speech recognition, speech analysis as well as music modeling have approached Mel-Frequency Cepstral Coefficient (MFCC) and confirmed great performance in comparison to other feature extractions. Based on obtained software performance, a wide range of hardware designs are applied to highly increasing integrated systems achieving real-time performance and ability of mobility. Nevertheless, most hardware approaches witnessing certain configurations have experienced limitation of functions due to fixed-point format, strict silicon requirements or exact applications, which is reasonable for low ability of reusing and high cost of product. As regards MFCC method, there are various concerning parameters such as number of samples, range of filter bands, Fast Fourier Transform (FFT) number, number of cepstrums or even different level of delta coefficients, which significantly affect final performance of entire applications. As a result, a dynamic ASIC-based MFCC hardware architecture is proposed in this paper in order to meet real-time system requiring high performance as well as confirm superiorities regarding to ability of reconfiguration feasibly through an Advance High-performance Bus (AHB) interface in chip level instead of modifying at Register Transfer Level (RTL) in developed duration. Besides, have not only experiments on 130nm technology with full ASIC design flow witnessed high frequency at 500MHz but applying IEEE 754 floating-point format has also confirmed great accuracy between hardware design and software design, which apply in certain application towards Vietnam automatic speech recognition (ASR).","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124431946","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 Research on 3D Model Construction from 2D DICOM","authors":"V. Nguyen, Manh Ha Tran, Hoang Minh Quang Vu","doi":"10.1109/ACOMP.2016.031","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.031","url":null,"abstract":"In recent years, the development of high techniques in the field of computer graphics, computer vision and images processing has been widely studied and applied in geometric modeling. Especially, in the field of 3D modeling and reconstruction of a 3D object from 2D images. One of these researches is the field of medical image processing. It has been invested and developed by researchers, both in computer science and medicine. This paper presents a survey research on construction and reconstruction of a 3D object from a set of 2D medical images. We first review the existing methods for building a 3D object from 2D medical image slices in DICOM (Digital Imaging and Communications in Medicine) format. They come from measurement devices in medicine like X-ray Computerized Tomography (X-ray CT), Magnetic Resonance Imaging (MRI), etc. Thereafter, we construct an application based on the VTK library for building, visualizing and handling a 3D object from these CT scanned slices. This application can support medical staffs and doctors in diagnostic and treatment of patients.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116084448","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":"Rew-XAC: An Approach to Rewriting Request for Elastic ABAC Enforcement with Dynamic Policies","authors":"H. Son, L. Tran, T. K. Dang, Yen Nhi Pham","doi":"10.1109/ACOMP.2016.014","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.014","url":null,"abstract":"Attribute-based access control (ABAC) model manages access control through policies, based on incoming requests in which attributes are basic elements for constructing those policies and requests. Requests depend on existing policies in the system and when policies change attributes, request must be adapted to access resources. In XACML standard, there are four kinds of responses for a request: Permit, Deny, Not Applicable and Indeterminate, but the two last value bring no value to requesters. This paper focuses on rewriting requests received Not Applicable responses by reducing required resource for aligning with policies of systems. We set up a new model based on XACML 3.0 find out the most suitable policy to each input request in four aspects, including Action, Subject, Environment, and Resource to rewrite the request. Finally, the model is implemented based on AT&T Open Source. We use an XACML 3.0 framework, for verifying feasibility of the solution and measuring its performance.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115032223","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 Bidirectional Local Search for the Stable Marriage Problem","authors":"H. Viet, L. Trang, SeungGwan Lee, TaeChoong Chung","doi":"10.1109/ACOMP.2016.013","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.013","url":null,"abstract":"This paper proposes a bidirectional local search algorithm to find the egalitarian and the sex-equal stable matchings in the stable marriage problem. Our approach simultaneously searches forward from the man-optimal stable matching and backwards from the woman-optimal stable matching until the search frontiers meet. By employing a breakmarriage strategy to find stable neighbor matchings of the current stable matching and moving to the best neighbor matching, the forward local search finds the solutions while moving towards the woman-optimal stable matching and the backward local search finds the solutions while moving towards the man-optimal stable matching. Simulations show that our proposed algorithm is efficient for the stable marriage problem.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"10887 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124715803","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":"Method of Mapping Vietnamese Chunked Sentences to Definite Shallow Structures","authors":"T. Tran, Dang Tuan Nguyen","doi":"10.1109/ACOMP.2016.020","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.020","url":null,"abstract":"In many natural language processing based intelligent systems, parsing is the first task to perform. However, in the next stages, many systems often have the capacity of processing a limited number of parsed structures. The problem is to determine what parsed sentences can be recognized by a system. The decision of syntactic structures which can be processed by a system is consider as the task of \"classification\" of a parsed sentence into one of given classes of recognizable parses. In this paper we deal with this issue by proposing a method for mapping Vietnamese chunked sentences to a set of pre-defined shallow structures. Also, we tag lexicons and chunk phrases of the original sentences using our Functional Part-of-Speech (FPOS) tagset with Apache OpenNLP tools (Tokenizer, POS Tagger, Chunker). Based on the foundation of Functional Grammar, we define new lexical tags and combine with Penn-Treebank tagset to build our FPOS tagset. Due to our set of shallow structures is finite, instead of using a parser, we propose a rule-based algorithm for the mapping process. We establish conversion rules according to the reality experiences when using Vietnamese in common communication. The experiment shows that we converse successfully for the major of testing sentences and the algorithm can be applied for different languages.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130380199","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":"Toward a Global Power Manager in Energy Harvesting Wireless Sensor Networks","authors":"The Duy Phan Dinh, T. N. Le, Anh-Vu Dinh-Duc","doi":"10.1109/ACOMP.2016.022","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.022","url":null,"abstract":"Wireless Sensor Networks (WSNs) bring a great attention in recent years due to their potential monitoring applications in remote areas, where wire connections are impractical to deploy. Moreover, energy harvesting capability is considered as a promising solution to extend the lifetime of the network. As ambient energy can be scavenged as long as desired, the lifetime of the network can be theoretically infinite. To achieve that, a Power Manager (PM) in a WSN node is required to balance between the consumed energy and the harvested energy to reach the Energy Neutral Operation (ENO) state. However, due to the limited resources in the WSN nodes, the localized PMs must be low complexity and thus less intelligent. In this paper, we propose a Global Power Manager (GPM) that is implemented at a base station to control adaptations of the WSN nodes' power in the network. This solution inaugurates a new paradigm to design an efficient PM as the base station has less constrained on memory, computational capability and particularly energy resources than the WSN nodes. Moreover, a survey of state-of-the-art localized PM techniques is presented. It provides fundamental operations of these techniques to achieve satisfactory performances within a given energy budget.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121411311","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}