2008 IEEE/ACS International Conference on Computer Systems and Applications最新文献

{"title":"Enhancement of IEEE 802.11 DCF backoff algorithm under heavy traffic","authors":"Issam Elarbaoui, H. Refai","doi":"10.1109/AICCSA.2008.4493682","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493682","url":null,"abstract":"The contention window size in carrier sense multiple access is crucial to the performance of a wireless network because it affects the network throughput and delay characteristics. The basic distributed coordination function (DCF) access mechanism of 802.11 standard describes multiple backoff window sizes. When a terminal is poised to transmit a packet, the smallest window is selected. If a collision occurs, the terminal selects an alternate backoff window. The selection is made in declining consecutive size until the largest one available at that given time is selected. This phenomenon occurs under heavy traffic conditions in which many terminals are accessing the wireless channel at the same time. Once a terminal successfully transmits its packet, the backoff window size reverts to the smallest size for future transmissions; however, this mechanism performs poorly under heavy traffic. This paper proposes that after a successful transmission, backoff window selection is dependent upon the number of retransmission; in other words, it is adaptive to the traffic condition of the network. This approach can alleviate retransmission rate by spreading the chances of simultaneous transmissions more evenly and with better flexibility relative to the basic DFC access mechanism of 802.11 MAC protocol. The MAC adopted for DSRC inter-vehicle communication applications provides enhanced delay properties,- mainly less delay due to collision-as well as throughput of the network. In our scheme a retransmission attempt of a terminal following the successful transmission of another will perform in one of two scenarios, and both are dependent upon the number of retransmissions occurring during a previous attempt Some terminals that reach a successful transmission after exceeding a certain value n will have to select a larger \"minimum contention window,\" while others will select a smaller one. A mathematical model is developed for this proposed scheme. Our simulation experiments validate the analytical results reported in the model, which was analyzed under various assumptions. Thus, the accuracy of our model is verified.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"1 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":"121701528","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":"Comparative performance evaluation of software-based fault-tolerant routing algorithms in adaptively-routed tori","authors":"F. Safaei, A. Khonsari, Amirhossein Shantia","doi":"10.1109/AICCSA.2008.4493572","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493572","url":null,"abstract":"Fault-tolerance and network routing have been among the most widely studied topics in the research of parallel processing and computer networking. A fault- tolerant routing algorithm should guarantee the delivery of messages in the presence of faulty components. In this paper, we present a comparative performance study of nine prominent fault-tolerant routings in 2D wormhole-switched tori. These networks carry the software-based routing scheme which has been suggested as an instance of a fault-tolerant method widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computer networks due to its ability to preserve both communication performance and fault-tolerant demands in such systems. The performance measures studied are the throughput, average message latency, power, and average usage of virtual channels per node. Results obtained through simulation suggest two classes of presented routing schemes as high performance candidates in most faulty networks.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"75 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":"114854911","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 Recursive Load Balancing technique for VoIP-dedicated WLANs","authors":"G. Sawma, I. Aib, K. Barbar, G. Pujolle","doi":"10.1109/AICCSA.2008.4493623","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493623","url":null,"abstract":"Intelligent and dynamic management is essential for improving WLAN efficiency, especially when multimedia and other QoS demanding applications are employed. In this paper, we propose a Recursive Autonomic Load Balancing Algorithm (RALBA)for WLANs and test its applicability for a VoIP over WLAN (VoWLAN) use case. A load metric is used to identify how many VoIP flows the WLAN cell can support. RALBA uses a Knowledge Plane to obtain high- level information about network state. The algorithm is presented and illustrated along with implementation plans.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"21 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":"131511508","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":"Numeral recognition using curvelet transform","authors":"Farhad Mohamad Kazemi, J. Izadian, Reihaneh Moravejian, E. Kazemi","doi":"10.1109/AICCSA.2008.4493593","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493593","url":null,"abstract":"This paper proposes the performance of two new algorithms for digit recognition. These recognition systems are based on extracted features on the performance of image's curvelet transform & achieving standard deviation and entropy of curvelet coefficients matrix in different scales & various angels. In addition, the proposed recognition systems are obtained by using different scales information as feature vector. So, we could clarify the most important scales in aspect of having useful information .Finally by employing the Knn classifier we classify them into predefined classes. The classifier was trained and test with handwritten numeral database, MNIST The results of this test shows, that our correct recognition rate in \"curvelet transform+ standard deviation\" algorithm is 93% and in \"curvelet transform+ entropy\" algorithm is 82%.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"69 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":"132598172","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":"Effects of dimensionality reduction techniques on time series similarity measurements","authors":"Ghazi Al-Naymat, J. Taheri","doi":"10.1109/AICCSA.2008.4493534","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493534","url":null,"abstract":"Time Series are ubiquitous, hence, similarity search is one of the biggest challenges in the area of mining time series data. This is due to the vast data size, number of sequences and number of dimensions that lead to a very costly querying process. In this paper, we demonstrate, for the first time, the use of three dimensionality reduction techniques (random projection (RP), Down sampling (DS) and Averaging (Avg)) in time series similarity searches. Two different similarity measurements are used for this investigation; dynamic time warping (DTW) and Euclidean distance. A thorough study has been conducted in this paper based on very exhaustive experiments. Results show the individual performance of Avg, RP, and DS in the two similarity measurements in different dimensions. Simulation shows that a high similarity matching accuracy can still be achieved after a significant dimension reduction onto lower dimensions.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"103 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":"117311533","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":"Commodity resource pricing in dynamic computational grids","authors":"K. Abdelkader, J. Broeckhove, K. Vanmechelen","doi":"10.1109/AICCSA.2008.4493568","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493568","url":null,"abstract":"We investigate resource management in computational grids based on an economic perspective. Specifically, we model the grid as a commodity market of CPU resources that are traded at prices determined by the supply-and- demand equilibrium. This approach has been shown to function for small, static grids. We present simulation results to demonstrate it can be extended to grids with a dynamic fabric and large (thousands) number of resources.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"7 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":"124471000","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":"Enumeration of maximal clique for mining spatial co-location patterns","authors":"Ghazi Al-Naymat","doi":"10.1109/AICCSA.2008.4493526","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493526","url":null,"abstract":"This paper presents a systematic approach to mine co- location patterns in Sloan Digital Sky Survey (SDSS) data. SDSS Data Release 5 (DR5) contains 3.6 TB of data. Availability of such large amount of useful data is an opportunity for application of data mining techniques to generate interesting information. The major reason for the lack of such data mining applications in SDSS is the unavailability of data in a suitable format. This work illustrates a procedure to obtain additional galaxy types from an available attributes and transform the data into maximal cliques of galaxies which in turn can be used as transactions for data mining applications. An efficient algorithm GridClique is proposed to generate maximal cliques from large spatial databases. It should be noted that the full general problem of extracting a maximal clique from a graph is known as NP-Hard. The experimental results show that the GridClique algorithm successfully generates all maximal cliques in the SDSS data and enables the generation of useful co-location patterns.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"224 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":"122069781","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":"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}