{"title":"Parallel PageRank computation using GPUs","authors":"N. Duong, Q. Nguyen, Anh Nguyen, Huu-Duc Nguyen","doi":"10.1145/2350716.2350751","DOIUrl":"https://doi.org/10.1145/2350716.2350751","url":null,"abstract":"Fast & efficient computing of web rank scores is a necessary issue of search engines today. Because of the enormous size of data and the dynamic nature of World Wide Web, this computation is generally executed on large web graphs (to billions webpages) and requires refreshing quite often, so it becomes a challenging task. In this paper, we propose an efficient method for computing PageRank score -- a Google ranking method based on analyzing the link structure of the Web on graphics processing units (GPUs). We have employed a slightly modification of a storage data format called binary 'link structure file' which inspirited from [2] for storing the web graph data. We then divided the PageRank calculating phases into parallel operations for exploiting the computing power of the graphics cards. Our program was written in CUDA language to experiment on a system equipped two double NVIDIA GeForce GTX 295 graphics cards, using two real datasets which were crawled from Vietnamese sites containing 7 million pages, 132 million links and 15 million pages, 200 million links, respectively. The experimental results showed that the computation speed increase from 10 to 20 times when compared to a CPU Intel Q8400 at 2.67 GHz based version, on both datasets. Our method can also scale up well for larger web graphs.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660162","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":"Comparing three lower bounding methods for DTW in time series classification","authors":"Nguyen Cong Thuong, D. T. Anh","doi":"10.1145/2350716.2350747","DOIUrl":"https://doi.org/10.1145/2350716.2350747","url":null,"abstract":"In comparison to Euclidean distance, Dynamic Time Warping (DTW) is a much more robust distance measure for time series data. For speeding up DTW computation, a few lower bounding techniques have been proposed in literature to guarantee no false dismissals in time series similarity search. In this work, we apply DTW lower bounding method in time series classification and empirically compare three different typical lower bounding techniques for DTW: LB_Keogh, FTW and LB_Improved in this time series data mining task. Our experimental results show that LB_Keogh and LB_Improved perform well with small warping window widths while FTW is only suitable with large warping window widths or without any constraint on warping windows. Besides, runtime efficiency of LB_Improved is quite poor due to its high complexity in lower bound computation despite of its better pruning power.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125456545","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 general solution supporting real-time and remote electrocardiogram diagnostic based on embedded and mobile technology","authors":"Dung Cao Tuan, T. Van, V. Anh","doi":"10.1145/2350716.2350744","DOIUrl":"https://doi.org/10.1145/2350716.2350744","url":null,"abstract":"Studying and applying computer science in supporting cardiovascular disease diagnostic have had many achievements in the world. In Vietnam, related studies, especially about Electrocardiogram- ECG (or EKG) are limited to theory researches and disconnected products, and have no complete solution to apply in healthcare centers, whereas foreign solutions are very expensive. In addition, having no up to date facilities, rural hospitals and healthcare centers in Vietnam cannot meet all the needs of patients and they have to move to big cities for treatment, while the diagnosis can be performed remotely with the advances in technology. Inspired from the actual needs and the growth of technology, we have proposed a general solution to manufacture ECG devices that has compact size, and their accuracy is equivalent with imported ones. We also develop software integrated with ECG devices that support users (patients and doctors) quickly and conveniently with smart-phone. We hope that our solution will bring more efficiency to healthcare centers in Vietnam, especially the doctor in large cities can support remote treatment for patients in rural hospitals. Our main modules are developed and tested separately with 77.50% of accuracy for automatic diagnostic module.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133472032","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":"Boundary extraction and simplification of a surface defined by a sparse 3D volume","authors":"V. Nguyen, A. Bac, M. Daniel","doi":"10.1145/2350716.2350735","DOIUrl":"https://doi.org/10.1145/2350716.2350735","url":null,"abstract":"Reconstructing surfaces with data coming from an automatic acquisition technique always entails the problem of mass of data. It leads to a mandatory data reduction process. Applying the process to the whole set of points induces an important risk of surface shrinking so that the initial boundary extraction is an important step permitting a simplification inside it. The global surface shape will then be better kept. It is nevertheless required to simplify the boundary, which can be done on the extracted boundary. In this paper, we present a new method to extract and simplify the boundary of an elevation surface given as voxels in a large 3D volume having the characteristics to be sparse since many data are missing. We first present our boundary definition based on mathematical relations between a point and its square neighborhoods. Second, we introduce algorithms to extract such a boundary. Third, we simplify this boundary.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133125834","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}
S. Nguyen, G. Jaskiewicz, Wojciech Swieboda, H. Nguyen
{"title":"Enhancing search result clustering with semantic indexing","authors":"S. Nguyen, G. Jaskiewicz, Wojciech Swieboda, H. Nguyen","doi":"10.1145/2350716.2350729","DOIUrl":"https://doi.org/10.1145/2350716.2350729","url":null,"abstract":"Semantic search results clustering is one of the most wanted functionalities of many information retrieval systems including general web search engines as well as domain specific article portals or digital libraries. It may advice the users to describe the need for information in a more precise way. In this paper, we discuss a framework of document description extension which utilizes domain knowledge and semantic similarity. Our idea is based on application of Tolerance Rough Set Model, semantic information extracted from source text and domain ontology to approximate concepts associated with documents and to enrich the vector representation. Some document representation models including document meta-data, citations and semantic information build using MeSH ontology. We compare those models in a search result clustering problem over the freely accessed biomedical research articles from Pubmed Cetral (PMC) portal. The experimental results are showing the advantages of the proposed models.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124541434","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":"Refining lexical translation training scheme for improving the quality of statistical phrase-based translation","authors":"Cuong Hoang, C. Le, S. Pham","doi":"10.1145/2350716.2350727","DOIUrl":"https://doi.org/10.1145/2350716.2350727","url":null,"abstract":"Under word-based alignment, frequent words with consistent translations can be aligned at a high rate of precision. However, the words that are less frequent or exhibit diverse translations in training corpora generally do not have statistically significant evidences for confident alignments [7]. In this work, we will focus on proposing a bootstrapping algorithm to capture those less frequent or exhibit diverse alignments. Interestingly, we avoid making any explicit assumption concerning with the pair of languages used. As the result, we take the experimental evaluations on two phrase-based translation systems: the English-Vietnamese and English-French translation systems. Experiments point out a significant \"boosting\" capacity for the quality in overall for both these tasks.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133008646","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":"Energy-balanced and fault-tolerant clustering routing protocol for event driven WSNs","authors":"M. Banh, G. Nguyen, T. Quynh","doi":"10.1145/2350716.2350740","DOIUrl":"https://doi.org/10.1145/2350716.2350740","url":null,"abstract":"In recent years, wireless sensor networks (WSNs) are increasingly developed in various areas of applications. The most important feature of WSN is that the sensor nodes are small size, limited processing and low power. Recent research has been focused on developing routing protocol for WSNs with thorough design addressing these features such as simplicity, energy efficiency and energy balance. Those approaches include various hierarchical clustering routing protocols such as LEACH, TEEN, PEGASIS, HEED and their variants. Our research investigates a novel routing protocol in a confined, less solved area of hierarchical clustering routing protocols: hierarchical clustering routing driven by events. We propose a cluster forming algorithm involving multiple rotational cluster heads (CHs) with different number of turns acting as the cluster head. We then investigate a routing mechanism for these multiple CHs to send data to the base station (BS) using common optimal route. Furthermore, in order to increase fault tolerance of WSNs, in our routing protocol, a sensor node needs satisfying required energy to become or remain as a CH. Simulation results in Omnet++ show that our protocol is better improved in energy efficiency, network lifetime, and overall network energy balance than existing protocols of the same type: OEDSR, ARPEES and HPEQ.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126671741","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":"GridLDA of Gabor wavelet features for palmprint identification","authors":"Hoang Thien Van, T. Le","doi":"10.1145/2350716.2350736","DOIUrl":"https://doi.org/10.1145/2350716.2350736","url":null,"abstract":"In this paper, we propose a novel palmprint recognition algorithm based on using GridLDA for Gabor wavelet features. Our proposed method includes two main steps for palmprint feature extraction: (1) Local invariant features are extracted by computing the Gabor wavelet Engergy of the original images that handles the palm structure and the variations of illumination. (2) An improved two-dimensional Linear Discriminant Analysis, called GridLDA, is then applied to further remove redundant information and form a discriminant representation more suitable for palmprint recognition. The experimental results for the identification on public database of Hong Kong Polytechnic University (PolyU) demonstrate the effectiveness of the proposed method.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132191378","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 Vietnamese web page clustering by combining neighbors' content and using iterative feature selection","authors":"Le Viet Hung, N. K. Anh, N. H. Dang","doi":"10.1145/2350716.2350726","DOIUrl":"https://doi.org/10.1145/2350716.2350726","url":null,"abstract":"Web page clustering is a fundamental technique to offer a solution for data management, information locating and its interpretation of Web data and to facilitate users for navigation, discrimination and understanding. Most existing clustering algorithms can't adapt well to Web page clustering directly in terms of efficiency and effectiveness due to the problems of high dimensionality and data sparseness. Furthermore, the uncontrolled nature of web content presents additional challenges to web page clustering, whereas the interconnected characteristic of hypertext can provide useful information for the process. To address this problem, we propose a new Web page clustering method with combining neighbors' content to overcome data sparseness and using Iterative Feature Selection to remove noisy and redundant features and to improve the performance of clustering algorithm. Experimental results show that the proposed method significantly improves the performance of the Vietnamese web page clustering with a relatively small number of good descriptive features for web pages.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134619912","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":"Implementation of model predictive control with modified minimal model on low-power RISC microcontrollers","authors":"Binh P. Nguyen, Y. Ho, Zimei Wu, C. Chui","doi":"10.1145/2350716.2350742","DOIUrl":"https://doi.org/10.1145/2350716.2350742","url":null,"abstract":"Due to the ability of modeling multivariable systems and handling constraints in the control framework, model predictive control (MPC) has received a lot of interest from both academic and industrial communities. Although it is an established control technique, implementing MPC on small-scale devices is a challenge since we need to handle complicated issues of the control framework using limited computational power and hardware resources. This paper presents our implementation of MPC with constraints on the Texas Instruments MSP430 16-bit microcontroller platform. The MPC operational constraints which are supported in our design include rate of change, amplitude and output constraints, while the associated optimization problem is solved using a primal-dual interior-point algorithm based on predicator-corrector method. Our implementation is demonstrated in a prototype of a real-time close-loop blood glucose regulation system using a modification of the minimal model. Experimental results show that our system is able to achieve desired diabetes management, and the chosen microprocessor is capable of performing the MPC algorithm accurately with high energy-efficiency and in real-time.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116748205","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}