{"title":"WiiKey: An Innovative Smartphone Based Wi-Fi Application","authors":"Nguyen Vo, Hao Shi, J. Szajman","doi":"10.1109/IMSCCS.2008.37","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.37","url":null,"abstract":"Many mobile applications such as email, calendar and web browser make use of smartphones technology. WiiKey, a proposed smart application, aims to extend the current smartphone capabilities to allow users to control the next generation Wi-Fi enabled devices found in some cars or home appliances. In this paper, Wi-Fi standards and their applications are first reviewed, and then the design and development of WiiKey prototype are described. Details of implementation of WiiKey using Java are presented. WiiKey has a potential to control smart objects in next generation of mobile devices. WiiKey brings benefits to users in their daily life and may one day become a true 'personal trust device'.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127512143","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}
Kangkang Zhang, Ru-zhi Xu, Yan Zhang, Ying Sai, Xiaobin Wang
{"title":"An Ontology Supported Semantic Web Service Composition Method in Enterprise Application Integration","authors":"Kangkang Zhang, Ru-zhi Xu, Yan Zhang, Ying Sai, Xiaobin Wang","doi":"10.1109/IMSCCS.2008.12","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.12","url":null,"abstract":"In EAI, current approaches based on Web Service are in short of flexibility because of lacking semantic. In this paper, we introduce an extended semantic matching algorithm of Web services in which state factors of Web services are considered. We also introduce an ontology supported semi-dynamic automatic Web service composition method to realize the integration of business processes in EAI. This method combines the advantages of simpleness of static service composition and flexibility of dynamic service composition.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131802552","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}
Shaobin Cai, Xi Li, Zhen-guo Gao, Nianmin Yao, Ying Tian
{"title":"Modified Improved Alternating Combination Trilateration Algorithm with a Variable m","authors":"Shaobin Cai, Xi Li, Zhen-guo Gao, Nianmin Yao, Ying Tian","doi":"10.1109/IMSCCS.2008.23","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.23","url":null,"abstract":"In most applications of wireless sensor network, the acquired information is useful only when their locations are known. Compared with ACT (alternating combination trilateration), IACT (improved alternating combination trilateration) has reduced its calculation overhead greatly. In IACT, The value of m, which determines how many triangles are used in calculations, is static. In this paper, the value of m is studied further, and a modified improved alternating combination trilateration is proposed. The simulation results show that its calculation can be reduced further when m is defined according to the number of anchor nodes.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129782136","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":"Hierarchical Star: An Optimal NoC Topology for High-Performance SoC Design","authors":"Zhaohui Song, Guangsheng Ma, Dalei Song","doi":"10.1109/IMSCCS.2008.38","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.38","url":null,"abstract":"An optimal network-on-chip (NoC) topology, hierarchical star topology, that uses the star graphs as building blocks is presented for high-performance system-on-chip (SoC) Design. Its topological properties are compared with the topologies in the same category in terms of various performance metrics including diameter, cost, fault tolerance, fault diameter etc. It has been shown that the hierarchical star topology is an optimal NoC topology. Simultaneously, popular and interesting topologies are compared in practical terms of energy consumption and area cost. Considering the energy and area cost together, the hierarchical star topology is the most energy-efficient and cost-effective topology.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"C-33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126488944","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 Redundant Multipath Routing for Mobile Ad Hoc Networks","authors":"Yang He, Juhua Pu, Z. Xiong","doi":"10.1109/IMSCCS.2008.21","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.21","url":null,"abstract":"Multipath routing provides more advantages for mobile ad hoc networks. We address the issue of enhancing route survivability and fault tolerance for packet reliable transmission, and propose the k-redundant multipath model which constructs multiple disjoint primary routes from the source to the destination and meanwhile provides the route redundancy among primary routes. We present the k-RMR protocol to establish the k-redundant multipath model in a distributed manner and prove its correctness. We perform theoretical analyses demonstrating that the k-redundant multipath which increases the redundant degree among disjoint routes is an effective way to enhance the route lifetime and transmission reliability. Meanwhile the simulation experiments indicate the k-redundant multipath routing is a promising way to improve the routing performance such as routing overheads, packet delivery delay and fraction.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120976997","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 Microarray Sample Size Using Bootstrap Data Combination","authors":"J. Phan, R. Moffitt, A. B. Barrett, May D. Wang","doi":"10.1109/IMSCCS.2008.36","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.36","url":null,"abstract":"Microarray technology has enabled us to simultaneously measure the expression of thousands of genes. Using this high-throughput technology, we can examine subtle genetic changes between biological samples and build predictive models for clinical applications. Although microarrays have dramatically increased the rate of data collection, sample size is still a major issue when selecting features. Previous methods show that combining multiple microarray datasets improves feature selection using simple methods such as fold change. We propose a wrapper-based gene selection technique that combines bootstrap estimated classification errors for individual genes across multiple datasets and reduces the contribution of datasets with high variance. We use the bootstrap because it is an unbiased estimator of classification error that is also effective for small sample data. Coupled with data combination across multiple datasets, we show that our meta-analytic approach improves the biological relevance of gene selection using prostate and renal cancer microarray data.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126254482","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":"HDW: A High Performance Large Scale Data Warehouse","authors":"Jinguo You, Jianqing Xi, Chuan Zhang, Gengqi Guo","doi":"10.1109/IMSCCS.2008.16","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.16","url":null,"abstract":"As data warehouses grow in size, ensuring adequate database performance will be a big challenge. This paper presents a solution, called HDW, based on Google infrastructure such as GFS, Bigtable, MapReduce to build and manage a large scale distributed data warehouse for high performance OLAP analysis. In addition, HDW provides XMLA standard interface for front end applications. The results show that HDW achieves pretty good performance and high scalability, which has been demonstrated on at least 18 nodes with 36 cores.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"8 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120919675","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":"Panchromatic and Multi-spectral Image Fusion Using WPT","authors":"Lin Ke-zheng, Li Hui","doi":"10.1109/IMSCCS.2008.47","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.47","url":null,"abstract":"In order to merge information from multi-sensor adequately, this paper analyzed the typical remote sensing image fusion methods. It proposed a new fusion method based on window local deviation using WPT (wavelet packet transform). WPT decomposed an image into low frequency hand and high frequency hand on different levels; local window and local sub-window statistic in the wavelet domain were used to further classify the wavelet coefficients into the edge and non-edge coefficients. In the fusion processing, the fused approximate coefficients were obtained by average method and the fused detailed coefficients were obtained by different area-based feature selection method and the greatest multi-window local deviation of the corresponding enter image wavelet packet coefficients. Experimental results show that the proposed method can retain the subtle detail of the image and can achieve an excellent effect. The new image fusion method provides a performance better than other methods.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121185192","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 Concurrency Control Algorithm Access to Temporal Data in Real-Time Database Systems","authors":"Qilong Han, Haiwei Pan, Guisheng Yin","doi":"10.1109/IMSCCS.2008.28","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.28","url":null,"abstract":"In this paper, we formalize and prove the correctness of a concurrency control algorithm for accessing to temporal data model in real-time database. A checking mechanism is proposed based on the semantic information of transaction deferrable time comparing transaction deadline with data deadline. The concurrency control algorithm improves the performance of real-time systems by evaluating data-deadline and transactions execution time, adjusting transaction validation rule and committing order. Theoretical analysis and example results demonstrate that the new algorithm can outperform the previous ones.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487794","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 Relational Approach for Pathway Analysis","authors":"C. Ashby, Xiuzhen Huang, J. Jenness, Joseph Kerby","doi":"10.1109/IMSCCS.2008.27","DOIUrl":"https://doi.org/10.1109/IMSCCS.2008.27","url":null,"abstract":"The relationship between interacting proteins can be represented using graphical network models. Comparison of models of similar protein networks can reveal important information about conserved protein interactions. The problem of determining conserved pathways between protein interaction networks are challenging and for large protein interaction networks are very computationally intensive. This paper developed and implemented a new relational approach for pathway analysis between protein interaction networks. Compared with the current known approaches, this relational approach is very computationally efficient.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130624674","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}