2013 IEEE 6th International Workshop on Computational Intelligence and Applications (IWCIA)最新文献_第4页

Solving the wafer probing scheduling problem using water flow-like algorithm 用类水流算法求解晶圆探测调度问题

2013 IEEE 6th International Workshop on Computational Intelligence and Applications (IWCIA) Pub Date : 2013-07-13 DOI: 10.1109/IWCIA.2013.6624805

Chin-Chih Chang, Feng-Chia Li

引用次数: 2

Parallel processing of approximate sequence matching using disk-based suffix tree on multi-core CPU 基于磁盘后缀树的多核CPU近似序列匹配并行处理

2013 IEEE 6th International Workshop on Computational Intelligence and Applications (IWCIA) Pub Date : 2013-07-13 DOI: 10.1109/IWCIA.2013.6624801

Yosuke Watanuki, Keiichi Tamura, H. Kitakami, Yoshifumi Takahashi

{"title":"Parallel processing of approximate sequence matching using disk-based suffix tree on multi-core CPU","authors":"Yosuke Watanuki, Keiichi Tamura, H. Kitakami, Yoshifumi Takahashi","doi":"10.1109/IWCIA.2013.6624801","DOIUrl":"https://doi.org/10.1109/IWCIA.2013.6624801","url":null,"abstract":"Suffix trees, which are trie structures that present the suffixes of given sequences (e.g., strings), are widely used for sequence search in different application domains such as, text data mining, web intelligence, bioinformatics and computational biology. In particular, suffix trees are useful in bioinformatics applications, because they can search similar sub-sequences and extract frequent sequence patterns efficiently. In recent years, efficient construction of a suffix tree that allows faster sequence searches has become one of the most important challenges, because the number and size of the data that are stored in sequence databases have been increasing exponentially. This paper proposes a novel parallelization model for approximate sequence matching that uses disk-based suffix trees, which are built on hard disks not on memory, on a multi-core CPU. In the proposed parallelization model, we divide an entire sequence database into two or more sub-databases called partitions. For each partition, we build a suffix tree and define a task as an approximate sequence matching on one suffix tree. Moreover, the proposed parallelization model involves a multiple buffering management system to avoid conflicts among CPU-cores. We evaluated the proposed parallelization model using an actual amino acid sequence database on a PC. The experimental results show a substantial improvement in computation performance.","PeriodicalId":257474,"journal":{"name":"2013 IEEE 6th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133887245","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}

引用次数: 2

An end-to-end middleware solution with multiple concurrent applications support for wireless body area networks 一个端到端中间件解决方案，支持多个并发应用程序，支持无线体域网络

2013 IEEE 6th International Workshop on Computational Intelligence and Applications (IWCIA) Pub Date : 2013-07-13 DOI: 10.1109/IWCIA.2013.6624815

M. Haghighi

{"title":"An end-to-end middleware solution with multiple concurrent applications support for wireless body area networks","authors":"M. Haghighi","doi":"10.1109/IWCIA.2013.6624815","DOIUrl":"https://doi.org/10.1109/IWCIA.2013.6624815","url":null,"abstract":"WSNs have gained increasing attention for monitoring various parameters of interest for a wide variety of applications, ranging from environmental conditions to healthcare. WSNs aimed at medical and healthcare applications are known as Wireless Body Area Network or WBANs. WSNs are very resource-constraint and mostly deployed in environments where physical access is difficult or impossible. WBANs however lack those limitations as they are easy to reach and their energy sources, e.g. batteries, can be recharged frequently. In terms of software, existing solutions for both WSNs and WBANs are either tightly-coupled hardware and software or very application-specific. Such diversity introduces many challenges for application developers. In this paper we will demonstrate how Sensomax, which is an agent-based multi-application WSN middleware, can be an ideal candidate for healthcare application, where multiple subjects such as patients and elderlies need to be monitored simultaneously. Our proposed architecture runs on Java (SE and ME) programming platforms for easy task distribution and data gathering with integrated supports for multiple concurrent applications, dynamic reprogramming, good scalability, and multiple operational paradigms.","PeriodicalId":257474,"journal":{"name":"2013 IEEE 6th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116450235","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}

引用次数: 4

Personal tour planning incorporating standard tour routes and tourist satisfaction 结合标准旅游路线和游客满意度的个人旅游规划

2013 IEEE 6th International Workshop on Computational Intelligence and Applications (IWCIA) Pub Date : 2013-07-13 DOI: 10.1109/IWCIA.2013.6624802

T. Hasuike, H. Tsubaki, H. Katagiri, H. Tsuda

{"title":"Personal tour planning incorporating standard tour routes and tourist satisfaction","authors":"T. Hasuike, H. Tsubaki, H. Katagiri, H. Tsuda","doi":"10.1109/IWCIA.2013.6624802","DOIUrl":"https://doi.org/10.1109/IWCIA.2013.6624802","url":null,"abstract":"This paper proposes a personal tour planning problem incorporating general tour routes and tourists satisfactions for sightseeing places based on some purposes of tourism. In order to construct a tour route, time-dependent satisfactions, traveling and activity duration times for sightseeing should be considered, but it is difficult to represent the time-dependent model using general static network models. Therefore, Time-Expanded Network (TEN) is introduced, which contains a copy to the set of nodes in the underlying static network for each discrete time step, and it turns the problem of determining an optimal flow over time into a classical static network flow problem. The proposed model is formulated as a bi-objective 0-1 integer programming problem maximizing the total satisfaction value and minimizing the difference from the best plan of standard tour routes. It also equivalently transformed into several existing tour planning problems using some natural assumptions and the concept of Pareto optimal solution, which can be applied existing useful combinatorial optimization and soft computing algorithms.","PeriodicalId":257474,"journal":{"name":"2013 IEEE 6th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132498201","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}

引用次数: 2