{"title":"Conversion of Mate-Pair Reads into Long Sequences for Improving Assembly Scaffolding","authors":"Chao-Hung Lee, Cheng-Wei Tsai, Yao-Ting Huang","doi":"10.1109/ICS.2016.0018","DOIUrl":"https://doi.org/10.1109/ICS.2016.0018","url":null,"abstract":"Mate-pair sequencing is a technology for sequencing two ends of long DNA fragments, which has been widely used in genome scaffolding. Although the cost of mate-pair sequencing is now affordable, its accuracy has been limited by the lower quality and contamination. The 3rd generation sequencing is able to generate long reads for genome scaffolding. However, the error rates and cost are still too high. This paper aims to convert low-cost mate-pair reads into long reads using computational approaches, which has the benefits of both mate-pair reads and long reads for scaffolding. We test our methods by using several real datasets and validate the accuracy of converted long reads. In addition, the scaffolding results are compared using mate-pair reads, long reads, and mixture of both material.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124697142","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":"GPU-Based Acceleration of Regression Test Suite Reduction","authors":"Chu-Ti Lin, Longhui Chang, Wen-Yuan Chen","doi":"10.1109/ICS.2016.0126","DOIUrl":"https://doi.org/10.1109/ICS.2016.0126","url":null,"abstract":"If software developers adopt test automation, the costs of development and maintenance will significantly decrease and the quality of regression testing will also increase. However, the number of test cases generally grows as the software under test evolves. It will take too much time to run all of the test cases during regression testing even though test automation is adopted. This may delay the time to release software products. Thus, a test team should choose a representative set of test cases from the original test suite so that the regression testing can be accomplished in a tight build schedule and the quality of regression testing is still satisfactory. This process is called test suite reduction. The problem of test suite reduction has received considerable attention in recent decades. Many test suite reduction methods have been proposed in the literature. Yet, reducing the test suite is a time-consuming process. Performing test suite reduction is also an extra cost of regression testing. It is fortunate that General-purpose Computing on Graphics Processing Units (GPUs) are suitable to accelerate the processing of a large quantity of digital data. Thus, this paper aims to accelerate test suite reduction method using GPUs. Our empirical studies include some frequently chosen benchmarks for experimentally evaluating the effectiveness of our approach and the empirical results indicate that the presented approach works well for a test suite of high complexity.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126324010","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":"Recognition of Dithering Patterns for Ordered Dither Technique","authors":"Chyi-Hwa Chu","doi":"10.1109/ICS.2016.0080","DOIUrl":"https://doi.org/10.1109/ICS.2016.0080","url":null,"abstract":"Most of applications for halftoning images are designed for a particular halftoning method. Under an automatic system, a pre-processor is needed to recognize the halftoning images and then a suitable technique can be applied to them. In this paper, a novel technique is proposed to recognize the visual patterns by order dither technique. It takes the properties of pixel ordering in the halftoning patterns by dither matrices. Our experiments indicate that sixty halftoning images by order dither technique and error diffusion with variant parameters can be correctly classified without manual operations.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127478862","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}
Jheng-Jhe Sie, Shang-Chen Yang, Zih-Yun Hong, Chien-Kai Liu, Jen-Jee Chen, S. C. Li
{"title":"Integrating Cloud Computing, Internet-of-Things (IoT), and Community to Support Long-Term Care and Lost Elderly Searching","authors":"Jheng-Jhe Sie, Shang-Chen Yang, Zih-Yun Hong, Chien-Kai Liu, Jen-Jee Chen, S. C. Li","doi":"10.1109/ICS.2016.0097","DOIUrl":"https://doi.org/10.1109/ICS.2016.0097","url":null,"abstract":"With the more and more serious population aging problem, the demand of long-term care is increasing. Actually, most of the aging people have the ability to take care of themselves, some warm concerns, medical advices, and timely remainders can effectively improve their living quality. Therefore, an automatic system to track and record elderly people's daily life and activities is required. In this paper, we propose a Long-term cArE-based Smart hOme platform (LAESO), which integrates the cloud, IoT, sensor networks, and community. The proposed LAESO platform combines with a variety of services, such as motion detection, activity detection and log, e-Care, indoor positioning, location-based real-time video monitoring, emergency notification, and lost elderly searching. Detected motions and activities of the elderly will be logged on to the cloud platform. With the log, e-Care can produce graphics and charts by doing statistics. Accordingly, family members and caregivers are able to understand the daily life and activity changes of the elderly. Moreover, we integrate the particle filter and 9-axis sensor to provide indoor positioning. LAESO platform also develops the emergency notification and location-based real-time video monitoring services to handle emergency events, i.e., the elderly falls down. Finally, we propose a novel lost elderly searching method, which combines the GPS positioning and crowd sensing to help find the missing elderly. Our real prototyping experience and some experimental results are also reported.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125309262","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 Evaluations of Different Parallel Programming Paradigms for Pennes Bioheat Equations and Navier-Stokes Equations","authors":"C. Chou, Kuen-Tsann Chen","doi":"10.1109/ICS.2016.0106","DOIUrl":"https://doi.org/10.1109/ICS.2016.0106","url":null,"abstract":"The chip heat dissipations defeat the clock speed increment. Multi-core clusters and the heterogeneous platforms including accelerators become a main trend recently. Parallel programming paradigms surfs on these diverse platforms: CUDA C, CUDA Fortran, OpenCL, OpenACC, OpenMP, MPI, pthread, MapReduce, and so on. The quantitative performance indexes help get a good picture of parallel programming paradigms for the applications. This study employ two examples: Pennes bioheat equations to simulating local hyperthermia destroying tumor cells and Navier-Stokes equations to simulating driven cavity flow at high Reynolds numbers via parallel programming paradigms: CUDA C, CUDA Fortran, OpenMP and MPI. Parallel programming in MPI for Pennes bioheat equations shows super-linear speedup on NCHC (National Center for High-performance Computing) ALPS and significantly faster than the original author, whereas Parallel programming in CUDA C framework for Navier-Stokes equations achieves around 24 times speedup on a NVIDIA C1060 GPU. We hope these results to support useful suggestions.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117167088","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":"Using Finite Element Method to Solve the Load-Balancing Routing Problem for Massively-Dense Wireless Sensor Networks","authors":"Ren-Song Ko","doi":"10.1109/ICS.2016.0048","DOIUrl":"https://doi.org/10.1109/ICS.2016.0048","url":null,"abstract":"This paper presents the grid-based directional routing algorithms for massively-dense wireless sensor networks. These algorithms have their theoretical foundation in numerically solving the load-balancing routing problems, which are formulated as partial differential equations via the geographical model. The numerical solutions provide the routing directions at equally spaced grid points in the region of interest, and then the directions can be used as guidance to route information. We investigate the numerical approach, the finite element method (and its derived distributed algorithm, DGSI-FEM), and present the numerical results to demonstrate the quality of the derived routing directions.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127829186","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":"Skyline Query-Based Attraction Recommendation System: An Example on Design and Development of the Demodulation and Encoding Heritage System","authors":"Yu-Ping Chen, Chee-Hoe Loh, Wei-You Chen, Wei-Jui Ho, Yi-Chung Chen","doi":"10.1109/ICS.2016.0070","DOIUrl":"https://doi.org/10.1109/ICS.2016.0070","url":null,"abstract":"Despite the continued expansion of tourism in Taiwan, the search systems used in the tourism sector lack the ability to recommend attractions. This means that users are required to spend additional time looking up information on numerous attractions before selecting their destinations. This study proposed a skyline query-based attraction recommendation system that takes into account the preferences and location of the user in the formulation of recommendations. The efficacy and feasibility of the proposed algorithm was demonstrated by applying it to a popular attraction query system referred to as the Demodulation and Encoding Heritage System.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126926785","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":"Disjunctive Total Domination Numbers of Grid Graphs","authors":"Chin-Fu Lin, Sheng-Lung Peng, Hong Yang","doi":"10.1109/ICS.2016.0024","DOIUrl":"https://doi.org/10.1109/ICS.2016.0024","url":null,"abstract":"For a graph G = (V, E), a subset D of V is a total dominating set of G if every vertex in V has to be adjacent to a vertex of D. Vertex subset D is a disjunctive total dominating set if every vertex of V is adjacent to a vertex of D or has at least two vertices in D at distance 2 from it. The disjunctive total domination problem on G is to find a disjunctive total dominating set D of the minimum cardinality. The cardinality of a minimum disjunctive total dominating set of G is called the disjunctive total domination number of G. In this paper, we study the disjunctive total domination problem on grid graphs. We propose upper bounds for general grid graphs. In particular, some bounds are optimal for some special cases.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115822495","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":"Smart Health Service System: Objectives, Framework and Solution","authors":"Yongan Guo, Longxiang Yang, Hongbo Zhu, Yulun Cheng, Feng Tian, Su Zhao","doi":"10.1109/ICS.2016.0140","DOIUrl":"https://doi.org/10.1109/ICS.2016.0140","url":null,"abstract":"Smart health service means utilizing the integration and collaboration of Internet of Things technology and modern health service technology to realize smart health service featuring ubiquity and personification. In consideration of the requirement and objective of health service and based on the 3S system of Internet of Things, this paper attempts to study and establish a user-centered, health service-driven and software definition-based multi-terminal and multi-network smart health service system, providing solutions for smart health service.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127854160","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}
Wei-Chung Hu, Tzu-Tan Wei, Cheng-Feng Yang, H. C. Jiau
{"title":"Reactive Programming Collaborative Agents for Self-Managing Software Teams","authors":"Wei-Chung Hu, Tzu-Tan Wei, Cheng-Feng Yang, H. C. Jiau","doi":"10.1109/ICS.2016.0121","DOIUrl":"https://doi.org/10.1109/ICS.2016.0121","url":null,"abstract":"In self-managing software teams, developers with complementary skills collaborate with each other to improve productivity and increase innovation. Due to nature of innovation, managers in these teams will acquire only summarized information from developers to avoid micromanagement. They will not plan fine-grained activities but leave responsibility and autonomy to self-managing developers. Developers discover collaboration opportunities from up-to-date assets and decide needed collaborative activities. To maintain effective and consistent collaboration, distributed knowledge of decision making from up-to-date assets must be captured and accumulated for these teams. This study proposes a method to distribute asset monitoring and decision making through reactive agents. Reactive programming technique is used to collaborate reactive agents. These agents present asset changes as event streams and provide time-varying reactions to each other as a network. The network can automatically react to decisions made by every agent. Through this method, self-managing software teams build their reactive knowledge network which responds to asset changes instantly and reveals collaboration opportunities intelligently.","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121272549","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}