{"title":"A methodology for discovering spatial co-location patterns","authors":"Fadi Deeb, L. Niepel","doi":"10.1109/AICCSA.2008.4493527","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493527","url":null,"abstract":"Spatial co-location patterns represent the subsets of events (services/features) whose instances are frequently located together in a geographic space. The co-location patterns discovery presents challenges since the instances of spatial events are embedded in a continuous space and share a variety of spatial relationships. In this paper, we provide a study based on some previous approaches, the concepts that were used, and some of their limitations. We propose a methodology which overcomes the shortcomings of some other approaches. This methodology is based on a spatial access method (KD-tree) with its basic operations and the apriori generation algorithm. The results of conducted experimentation show the correctness and completeness of our approach. The results also illustrate the effect of input data on the performance.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126384750","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":"Wireless Fair Queuing algorithm for window-based Link Level Retransmission","authors":"Abdul-Rahman Elshafei, U. Baroudi","doi":"10.1109/AICCSA.2008.4493562","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493562","url":null,"abstract":"Wireless networks have unreliable channels that experience bursty and location-dependent errors. Several fair queuing algorithms have been proposed in order to provide QoS in presence of errors in a fair manner. However, most of these algorithms are unpractical as they require perfect channel predication or do not work well with the Link Layer. Wireless fair queuing with retransmission (WFQ-R) algorithm was recently suggested to address these problems by penalizing flows that use wireless resources without permission in the link layer. However, the WFQ-R algorithm is based on stop-and-wait LLR scheme which also costs the network extensive delay and low utilization. In this paper, a new wireless fair queuing based on the WFQ-R algorithm is proposed to work with the window-based error control schemes in the link layer. The proposed algorithm has shown outstanding results compared with WFQ-R in terms of lower queuing delay, better throughput and fairly allocated resources.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125813643","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":"Self-localization based on improved subspace approach in wireless sensor network","authors":"Liu Hongbo, Zhang Wei","doi":"10.1109/AICCSA.2008.4493556","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493556","url":null,"abstract":"In this paper, an improved subspace approach based on range measurement is proposed and analyzed. Through the factorization of multidimensional similarity (MDS) matrix, we derive a novel kernel subspace to estimate the coordinate of unknown mobile node in wireless sensor networks (WSN). Simulation results are included to contrast the estimator performance with general subspace method, and the performance analysis is provided.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"267 1-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026000","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 phishing sites blacklist generator","authors":"M. Sharifi, Seyed Hossein Siadati","doi":"10.1109/AICCSA.2008.4493625","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493625","url":null,"abstract":"Phishing is an increasing web attack both in volume and techniques sophistication. Blacklists are used to resist this type of attack, but fail to make their lists up- to-date. This paper proposes a new technique and architecture for a blacklist generator that maintains an up-to-date blacklist of phishing sites. When a page claims that it belongs to a given company, the company's name is searched in a powerful search engine like Google. The domain of the page is then compared with the domain of each of the Google's top- 10 searched results. If a matching domain is found, the page is considered as a legitimate page, and otherwise as a phishing site. Preliminary evaluation of our technique has shown an accuracy of 91% in detecting legitimate pages and 100% in detecting phishing sites.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126133143","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":"Methodology for evaluating string matching algorithms on multiprocessor","authors":"B. Soewito, N. Weng","doi":"10.1109/AICCSA.2008.4493512","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493512","url":null,"abstract":"The Internet is suffering caused by the lacking of security. One of the most promising ways to provide security is Intrusion Detection Systems (IDSs). The heart of almost every IDSs is a string matching algorithm, which is a very computational intensive task. Network Processors (NPs), a specialized multiprocessor, can provide flexibility and high performance for string matching. This paper evaluates several key string matching algorithms using a comprehensive simulation framework. Starting from a uniprocessor profiling, the framework constructs task graphs for string matching algorithms. Then task graphs are mapped onto NPs together with other network applications. The system throughput is determined by the analytical performance model. With this framework, we can evaluate the performance of different string matching algorithms on NPs. Our results show that shift table based algorithms (SFKSearch and Wu-Manber) and finite automaton based Aho-Corasick are complementary: SFKSearch and Wu-Manber do better job in NPs for good packet and larger pattern length due to better inter-task parallelism and shifting; Aho-Corasick does not depend on minimal pattern length and shows relative small processing cost variation between bad and good packets.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"326 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113998596","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":"Preventing admission failures of bandwidth reservation in wireless mesh networks","authors":"A. Herms, G. Lukas","doi":"10.1109/AICCSA.2008.4493684","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493684","url":null,"abstract":"Quality of Service for wireless mesh networks is an often requested feature for various kinds of applications. A common approach is the hop-by-hop reservation of bandwidth for individual routes. In this paper we address the problems of the reservation on a single hop. In previous works we used simulation studies to show that various existing approaches suffer from inconsistencies that lead to admission failures. In this paper, we discuss the reasons for these failures and present a protocol for preventing them. This allows to significantly increase the reliability of established communication links in WMNs.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122979992","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":"P2P-based mobile IPTV: Challenges and opportunities","authors":"M. Mushtaq, T. Ahmed","doi":"10.1109/AICCSA.2008.4493663","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493663","url":null,"abstract":"In the last few years, we have witnessed a rapid growth of multimedia content delivery across the networks. Peer-to-Peer (P2P) networks are considered as one of the most suitable targeted infrastructure for supporting real time streaming and has played vital role in this growth. IPTV service is considered as the emerging application that has a great potential to incur new revenues for contents and service providers. This service gives more choice to the end users to consume TV programs in their personalized way and beyond any geographical constraints. The exploitation of P2P- based IPTV services has turned the dream of Universal Media Access (UMA) in reality. However, the efficient deployment of P2P-based IPTV with better Quality of Service (QoS) needs to address certain challenges. However, for the provision of better QoS IPTV service, we need to cope with the dynamic characteristics of P2P framework that can deter drastically the performance of such applications. In this paper, we emphasize some challenges, opportunities, and open issues regarding IPTV service over mobile terminals operating over P2P based networks.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128607983","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":"Improved image segmentation method based on optimized threshold using Genetic Algorithm","authors":"Xin Zhao, Myungeun Lee, Soohyung Kim","doi":"10.1109/AICCSA.2008.4493645","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493645","url":null,"abstract":"In image segmentation, threshold segmentation is becoming more and more widely used because of its simplicity and efficiency. In this paper, an improved image segmentation method based on optimized threshold using genetic algorithm is proposed. Compared with the traditional threshold segmentation methods, this method has advantages that it can nicely segment the thin and it can efficiently reduce calculation time and it has good capability and stabilization nature. The results show that using this proposed method can obtain satisfactory segmentation effect.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116033715","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":"RBT-I: A novel approach for solving the Multiple Sequence Alignment problem","authors":"J. Taheri, Albert Y. Zomaya, B. Zhou","doi":"10.1109/AICCSA.2008.4493513","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493513","url":null,"abstract":"This paper presents a novel approach to solve the multiple sequence alignment (MSA) problem. the rubber band technique: index base (RBT-I) introduced in this paper, is inspired by the elastic behavior of a rubber band (RB) on a plate with poles. RBT-I is an iterative optimization algorithm designed and implemented to find the optimal alignment for a set of input protein sequences. In this technique, the alignment answer of the MSA problem is modeled as a RB, while the answer space is modeled as the plate with several poles resembling locations in the input sequences that are most likely to be correlated and/or biologically related. Fixing the head and tail of the RB at two corners of this plate, the RB is free to bend and finds its best configuration, yielding the best answer for the MSA problem. RBT-I is tested with one of the well-known benchmarks (BALiBASE 2.0) in this field. The obtained results show the superiority of the proposed technique even in the case of formidable sequences.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116110826","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}
Samuel Cheng, L. Stanković, V. Stanković, H. Refai
{"title":"Cumulative intelligence gathering for smart vehicles","authors":"Samuel Cheng, L. Stanković, V. Stanković, H. Refai","doi":"10.1109/AICCSA.2008.4493683","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493683","url":null,"abstract":"Latest advances in sensor and communication technologies and computational intelligence will allow vehicles to observe their surroundings, process the collected information and communicate it with other vehicles, e.g., vehicles can sense adverse road conditions, experience traffic congestion, or detect accidents, and then adjust vehicle control. We investigate the problem of effective intelligence gathering in the perspectives of both communications and data fusion. The target system should have high processing and transmission accuracy for the gathered information as well as low communication load requirement. Assuming a binary source, we determine the theoretical bound for the error probability of gathered information and present a way of communicating the observation from individual vehicles to the destination. Compared to the flooding method, our model reduces the communication load by approximately N/log2N times, with N being the total number of the vehicles, without decreasing the accuracy of the gathered information.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116750463","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}