{"title":"Node-to-set disjoint paths in substring reversal graphs","authors":"Sinyu Jung, K. Kaneko","doi":"10.1109/JCSSE.2011.5930128","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930128","url":null,"abstract":"An n-substring reversal graph Sn is promising as a generic graph because it includes a hypercube, a pancake graph, and a bubble sort graph as its sub graphs. This paper proposes an algorithm N2S that solves the node-to-set disjoint paths problem in substring reversal graphs in polynomial-order time of n. In addition, we prove correctness of the algorithm and estimate the time complexity of the algorithm and the maximum length 6 of paths generated by the algorithm to be O(n6) and 2n−4, respectively.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125034124","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 similarity model for bibliographic records using subject headings","authors":"S. Maneewongvatana, S. Maneewongvatana","doi":"10.1109/JCSSE.2011.5930132","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930132","url":null,"abstract":"We propose a model for measuring similarity between bibliographic records based on their keywords or subject headings whose relationship can be represented in form of the semantic hierarchical network. In our work, the level of each subject heading in the semantic hierarchical network plays a major role to determine keyword's infuence. Highly specifc subject headings represented as leaf nodes of the model are better indicators to explain the content of a bibliographic record than the more general ones. The proposed algorithm calculates the level of similarity between records by considering path from one subject heading to another contained in the records. With this algorithm, related bibliographic records do not necessary to have exactly the same subject heading. The implication of this work can be applied to various types of document classifcation whose set of tags or keywords are organized in a semantic hierarchical network.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116448831","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":"Performance evaluation of ZFS and LVM (with ext4) for scalable storage system","authors":"Veerapat Phromchana, N. Nupairoj, K. Piromsopa","doi":"10.1109/JCSSE.2011.5930130","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930130","url":null,"abstract":"Recently, multimedia document sharing, e.g. images, music, movies, etc., has become increasingly popular, which escalates the need for more storage spaces. However, designing scalable storage system requires the right combination of volume manager and disk accessing protocols in order to achieve both extensibility and high performance. This paper evaluates the implementation of 2 popular volume managers, ZFS and LVM (with ext4), in many configurations. Our study will help identify the best practices of implementing scalable storage system in various conditions.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116463495","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":"OPI model: A methodology for development metric based on outcome oriented","authors":"Kaenchan Thammarak, Sarun Intakosum","doi":"10.1109/JCSSE.2011.5930144","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930144","url":null,"abstract":"Metric is extremely important for software development. It is a tool for measuring software in both quantitative and qualitative aspects. In addition, metric can be used for determining an achievement of the goals. There are some problems that bring difficulties to the design and development of software metrics. Among them, a number of software perspectives that metrics must handle and the way to apply metrics results to support business outcomes are considered important. This paper proposes OPI as a model for implementing software metrics based on business outcomes. There are three steps in this model, defining outcomes (O), defining perspectives (P), and defining indicators (I). A case study has been developed to assess the use of the proposed model. Forty undergraduate students, who have basic knowledge in software metric, use the model to develop metrics from the case study. The preliminary evaluation is based on usability aspect. The result has show that 85 percents of the students think that the model is easy to understand, where 8 and 7 percents say that it is moderate and hard respectively.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126998681","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":"Mining social networks of Thai researchers in IT-related areas","authors":"Songsri Tangsripairoj, Usanee Sripirom","doi":"10.1109/JCSSE.2011.5930151","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930151","url":null,"abstract":"This research focuses on the study of social networks of Thai researchers that conducted research in the computer science and information technology fields and submitted their works to two conferences which are the International Joint Conference on Computer Science and Software Engineering (JCSSE) and the National Computer Science and Engineering Conference (NCSEC) between 2005 and 2008. The bibliographical data which appeared in their research was extracted for database construction. The principle of Social Network Analysis was applied for data analysis in order to find relationships between researchers, research topic categories, conferences and years in which they were organized. The data analysis enables users to know which researchers in Thailand conducted their research in what area, to which academic institutes they were attached, and who were their co-authors. In addition, the analysis result also allows users to see trends of research topics of Thai researchers. It was hoped that as a result of this analysis, the derived database will be useful for people who wish to search for research data in areas in which they are interested. Similarly, government agencies working on the promotion and support of research work will be informed of research trends in Thailand so as to speed up work in support of conducting research in significant areas or those in which the country is lacking.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132799558","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":"Nebular: A sentiment classification system for the tourism business","authors":"Srisupa Palakvangsa-Na-Ayudhya, Veerapat Sriarunrungreung, Pantipa Thongprasan, Satit Porcharoen","doi":"10.1109/JCSSE.2011.5930137","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930137","url":null,"abstract":"Due to the rapid growth of the tourism industry around the globe, tourists tend to find information of interesting attractions via available search engines. With the rapid growth of Web 2.0 in the past few years, tourists generally share their experiences through travel social network websites (Travel 2.0) such as TripAdvisor, VirtuaiTourist and Yahoo Travel. These websites have become major sources of information for tourists; however, due to the amount of available opinionated text, tourists are often overwhelmed with information. As a consequence, tourists find it extremely difficult to obtain any useful comments to make a decision regarding their travel destinations. The Nebular system is therefore proposed to classify comments gathered from available travel social network websites into predefined aspects and further analyze comments into positive and negative sentiments. This system aims to assist tourists to easily extract subjective information from travel social network websites and determine the attitude and the overall tonality of writers in the traveling domain. This can reduce the time required in searching for related information as well as easily support the growth of the tourism industry around the world.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130826605","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}
E. Kijsipongse, S. U-ruekolan, C. Ngamphiw, S. Tongsima
{"title":"Efficient large Pearson correlation matrix computing using hybrid MPI/CUDA","authors":"E. Kijsipongse, S. U-ruekolan, C. Ngamphiw, S. Tongsima","doi":"10.1109/JCSSE.2011.5930127","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930127","url":null,"abstract":"The calculation of pairwise correlation coefficient on a dataset, known as the correlation matrix, is often used in data analysis, signal processing, pattern recognition, image processing, and bioinformatics. With the state-of-the-art Graphic Processing Units (GPUs) that consist of massive cores capable to do processing up to several Gflops, the calculation of correlation matrix can be accelerated several times over traditional CPUs. However, due to the rapid growth of the data in the digital era, the correlation matrix calculation becomes computing intensive which needs to be executed on multiple GPUs. As of now, GPUs are common components in data center at many institutions. Their GPU deployment tends towards a GPU cluster which each node is equipped with GPUs. In this paper, we propose a parallel computing based on the hybrid MPI/CUDA programming for fast and efficient Pearson correlation matrix calculation on GPU clusters. At coarse grain parallelism, the correlation matrix is partitioned into tiles which are distributed to execute concurrently on many GPUs using MPI. At fine grain level, the CUDA kernel function on each node performs massively parallel computing on a GPU. To balance load across all GPUs, we adopt the work pool model which there is a master node that manages tasks in the work pool and dynamically assign tasks to worker nodes. The result of the evaluation shows that the proposed work can ensure the load balance across different GPUs and thus gives better execution time than using a simple static data partitioning.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"46 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121421095","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 Shot course estimation system for tactics analysis support of handball games","authors":"A. Abe, I. Shimizu","doi":"10.1109/JCSSE.2011.5930098","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930098","url":null,"abstract":"In this paper, we propose a 3D shoot course estimation method for tactics analysis of handball games using the video recordings captured by two interlaced video cameras. To achieve the accurate estimation of the 3D position of the ball, an algorithm for temporal and geometrical calibration is employed to calibrate two cameras because the speed of the ball is high and the sub-frame calibration is important for our system. To estimate the 3D position of the ball, it is important to detect the 2D positions of the ball in respective frames captured by each camera. However, many false detections occur because of occlusions caused by frequent hard contact play and highspeed moving ball thrown by a player to the goal. Therefore, we eliminate the false detections based on the consistency of the ball positions through multiple frames using the fact that the trajectory of the ball is straight in almost all of the case.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123339920","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":"Scan conversion for Bézier curve using degree elevation technique","authors":"Chitsanuphong Thanutong, N. Dejdumrong","doi":"10.1109/JCSSE.2011.5930123","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930123","url":null,"abstract":"There are several techniques used for plotting a Bézier curve, i.e., using direct Bernstein basis computation, employing the de Casteljau algorithm, and polar form approach. However, all of them suffer from the computational complexity and there are several attempts to enhance the efficiency for the construction of Bézier curves. Iterative method of de Casteljau algorithm and conversion into more efficient models are examples. One way to improve the speed of the curve computation is the scan conversion method that has been widely used for line, ellipse. In this paper, the degree elevation technique is used to proficiently scan-convert Bézier curves with O(N Log N) complexity.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123296186","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":"Towards a complete project oriented risk management model: A refinement of PRORISK","authors":"Boriwat Suebkuna, Sakgasit Ramingwong","doi":"10.1109/JCSSE.2011.5930146","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930146","url":null,"abstract":"PRORSK is a conceptual model which was developed to simultaneously address importance of project management and risk management in software projects. This paper further refines this model by incorporating insights from experienced Thai software engineers, resulting in a more complete and practical project oriented risk management model which can be further applied in standard software projects.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115374710","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}