Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723912
N. Sarkar
This paper proposes a cross-layer design (CLD) framework called channel-aware buffer unit multiple access (C-BUMA) for improving wireless local area network (WLAN) performance. In the framework, the radio propagation (i.e. PHY layer) is combined with the medium access control (MAC) protocol for packet transmissions. By sharing channel information with the MAC protocol, the approach reduced unnecessary packet transmissions and hence improved system performance. Through performance evaluation, we demonstrate that our CLD can significantly improve network throughput and packet delay. The proposed C-BUMA is simple and can easily be implemented in 802.11 networks without changing hardware infrastructure and no additional costs. In this paper we describe C-BUMA and present two algorithms for the implementation of the framework.
{"title":"A cross layer framework for WLANs: Joint radio propagation and MAC protocol","authors":"N. Sarkar","doi":"10.1109/ICCITECHN.2010.5723912","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723912","url":null,"abstract":"This paper proposes a cross-layer design (CLD) framework called channel-aware buffer unit multiple access (C-BUMA) for improving wireless local area network (WLAN) performance. In the framework, the radio propagation (i.e. PHY layer) is combined with the medium access control (MAC) protocol for packet transmissions. By sharing channel information with the MAC protocol, the approach reduced unnecessary packet transmissions and hence improved system performance. Through performance evaluation, we demonstrate that our CLD can significantly improve network throughput and packet delay. The proposed C-BUMA is simple and can easily be implemented in 802.11 networks without changing hardware infrastructure and no additional costs. In this paper we describe C-BUMA and present two algorithms for the implementation of the framework.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121988835","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723822
M. Rahman, A. K. Mia
This paper presents an efficient O(n3) time algorithm for solving the seeded tree alignment problem that finds the similarity score of two RNA secondary structures. In the seeded tree alignment problem, a large tree, representing an RNA secondary structure, is converted into a small tree known as seeded tree. After conversion, a comparison operation is being placed to find the similarity score of necessary seed pair of two seeded trees and finally the overall trees. The algorithm is more efficient than the best known algorithm that needs O(n3.5) time.
{"title":"An efficient seeded tree alignment algorithm for finding the similarity score of two RNA secondary structures","authors":"M. Rahman, A. K. Mia","doi":"10.1109/ICCITECHN.2010.5723822","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723822","url":null,"abstract":"This paper presents an efficient O(n3) time algorithm for solving the seeded tree alignment problem that finds the similarity score of two RNA secondary structures. In the seeded tree alignment problem, a large tree, representing an RNA secondary structure, is converted into a small tree known as seeded tree. After conversion, a comparison operation is being placed to find the similarity score of necessary seed pair of two seeded trees and finally the overall trees. The algorithm is more efficient than the best known algorithm that needs O(n3.5) time.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117208071","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723853
Sanchita Mal-Sarkar, I. Sikder, V. Konangi
This paper proposes a soft computing approach to manage uncertainty and rule discovery by reasoning over inconsistent, incomplete and fragmentary information using dominance-based rough set theories. A methodological and computational basis is illustrated in a sensor network application scenario of a forest fire detection system.
{"title":"Application of wireless sensor networks in forest fire detection under uncertainty","authors":"Sanchita Mal-Sarkar, I. Sikder, V. Konangi","doi":"10.1109/ICCITECHN.2010.5723853","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723853","url":null,"abstract":"This paper proposes a soft computing approach to manage uncertainty and rule discovery by reasoning over inconsistent, incomplete and fragmentary information using dominance-based rough set theories. A methodological and computational basis is illustrated in a sensor network application scenario of a forest fire detection system.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117216832","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723880
Md. Sayem Chowdury, G. M. Rokibul Hasan, K. H. Talukder
Binary Decision Diagram has a great impact on the Boolean function manipulation for its compressed and canonical presentation. In switching function organization ROBDD (Reduced Ordered Binary Decision Diagram) with a fixed variable ordering plays a significant role for its distinctiveness. Combination of multiple functions using switching operations has more redundant states. For removing these redundant states we apply ROBDD in this joining process. In this paper, we presented the way of combining n number of functions using ROBDD with a fixed variable ordering. In our proposed method at first, we compute each function's ROBDD over Shannon's expression. Then switching operations are going to be performed over these functions and ROBDD of the combinations of these functions are also computed. By this method, appearance of redundant states will be less. To construct an understandable and simple method, some examples have been used.
{"title":"A composition technique of multiple switching functions based on BDD","authors":"Md. Sayem Chowdury, G. M. Rokibul Hasan, K. H. Talukder","doi":"10.1109/ICCITECHN.2010.5723880","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723880","url":null,"abstract":"Binary Decision Diagram has a great impact on the Boolean function manipulation for its compressed and canonical presentation. In switching function organization ROBDD (Reduced Ordered Binary Decision Diagram) with a fixed variable ordering plays a significant role for its distinctiveness. Combination of multiple functions using switching operations has more redundant states. For removing these redundant states we apply ROBDD in this joining process. In this paper, we presented the way of combining n number of functions using ROBDD with a fixed variable ordering. In our proposed method at first, we compute each function's ROBDD over Shannon's expression. Then switching operations are going to be performed over these functions and ROBDD of the combinations of these functions are also computed. By this method, appearance of redundant states will be less. To construct an understandable and simple method, some examples have been used.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124781695","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723890
A. K. M. Zahiduzzaman, Mohammed Nahyan Quasem, Mridul Khan, R. Rahman
Data mining is the process of extracting non-trivial patterns from large volume of data. It generates insight and turns the data into valuable information. A critical yet common flaw when performing data mining is to ignore the geographic locations from where the data is taken. When this geospatial attribute of the data is taken into consideration, the process is known to be geospatial data mining. This task essentially deals with the detection of spatial patterns in the data, the formulation of hypotheses and the assessment of descriptive or predictive spatial models. Spatial data mining could provide interesting and useful information to government, environmentalists and relevant decision makers' in the assessment of the relative performance of a particular geographic area. The results could also be used for causal analysis by domain experts. In our research we perform spatial data mining using literacy rates and the number of educational establishments. The data is from the 64 well defined administrative units of Bangladesh known as Zilas. This paper contains a summary of the theory, methodology and detailed analysis of results. We compare the results found by spatial model with classical regression model. The results demonstrate that spatial lag model outperforms the classical model in different perspectives.
{"title":"Spatial data mining on literacy rates and educational establishments in Bangladesh","authors":"A. K. M. Zahiduzzaman, Mohammed Nahyan Quasem, Mridul Khan, R. Rahman","doi":"10.1109/ICCITECHN.2010.5723890","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723890","url":null,"abstract":"Data mining is the process of extracting non-trivial patterns from large volume of data. It generates insight and turns the data into valuable information. A critical yet common flaw when performing data mining is to ignore the geographic locations from where the data is taken. When this geospatial attribute of the data is taken into consideration, the process is known to be geospatial data mining. This task essentially deals with the detection of spatial patterns in the data, the formulation of hypotheses and the assessment of descriptive or predictive spatial models. Spatial data mining could provide interesting and useful information to government, environmentalists and relevant decision makers' in the assessment of the relative performance of a particular geographic area. The results could also be used for causal analysis by domain experts. In our research we perform spatial data mining using literacy rates and the number of educational establishments. The data is from the 64 well defined administrative units of Bangladesh known as Zilas. This paper contains a summary of the theory, methodology and detailed analysis of results. We compare the results found by spatial model with classical regression model. The results demonstrate that spatial lag model outperforms the classical model in different perspectives.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125027760","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723857
M. J. Rahman, Xianbin Wang, S. Park, H. Kim
Synchronization is considered an important design issue for the implementation of digital television (DTV) receiver, specially for proper reception of multipath distorted signal at low signal to noise ratio (SNR). This challenge is more pronounced in complex multipath channel scenarios and for high mobility applications in presence of carrier frequency offset (CFO). In this paper, time domain correlation technique based on multiple PN-511 sequences is proposed to improve the synchronization performance of DTV broadcasting system that is robust against multipath impairments and CFO. Due to self-resolving capability of the multipath components, proposed synchronization algorithm provides better performance than conventional single PN-511 based algorithm in complex multipath channel. Since only the received adjacent PN-511 sequences are considered in the correlation process, the proposed technique is robust against CFO as well. In addition, the proposed technique provides higher peak-to-noise ratio (PNR), therefore this technique can be effectively used at low SNR conditions. Further, maximum likelihood (ML) estimation for multiple PN-511 based algorithm is carried out to evaluate the feasibility of the proposed algorithm.
{"title":"Robust synchronization technique for mobile DTV broadcasting system","authors":"M. J. Rahman, Xianbin Wang, S. Park, H. Kim","doi":"10.1109/ICCITECHN.2010.5723857","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723857","url":null,"abstract":"Synchronization is considered an important design issue for the implementation of digital television (DTV) receiver, specially for proper reception of multipath distorted signal at low signal to noise ratio (SNR). This challenge is more pronounced in complex multipath channel scenarios and for high mobility applications in presence of carrier frequency offset (CFO). In this paper, time domain correlation technique based on multiple PN-511 sequences is proposed to improve the synchronization performance of DTV broadcasting system that is robust against multipath impairments and CFO. Due to self-resolving capability of the multipath components, proposed synchronization algorithm provides better performance than conventional single PN-511 based algorithm in complex multipath channel. Since only the received adjacent PN-511 sequences are considered in the correlation process, the proposed technique is robust against CFO as well. In addition, the proposed technique provides higher peak-to-noise ratio (PNR), therefore this technique can be effectively used at low SNR conditions. Further, maximum likelihood (ML) estimation for multiple PN-511 based algorithm is carried out to evaluate the feasibility of the proposed algorithm.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128256350","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723889
S. M. Monzurur Rahman, M.R.A. Kotwal, Xinghuo Yu
Classification rules are the interest of most data miners to summarize the discrimination ability of classes present in data. A classification rule is an assertion, which discriminates the concepts of one class from other classes. The most classification rules mining algorithm aims to providing a single solution where multiple solutions exist. Moreover, it does not guarantee the optimal solution and user has not any control over the classification error rate. In this paper, we addressed these problems inherent in mostly used classification algorithms. A solution has been proposed to solve these problems and it has been tested with experimental data.
{"title":"Mining classification rules via an apriori approach","authors":"S. M. Monzurur Rahman, M.R.A. Kotwal, Xinghuo Yu","doi":"10.1109/ICCITECHN.2010.5723889","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723889","url":null,"abstract":"Classification rules are the interest of most data miners to summarize the discrimination ability of classes present in data. A classification rule is an assertion, which discriminates the concepts of one class from other classes. The most classification rules mining algorithm aims to providing a single solution where multiple solutions exist. Moreover, it does not guarantee the optimal solution and user has not any control over the classification error rate. In this paper, we addressed these problems inherent in mostly used classification algorithms. A solution has been proposed to solve these problems and it has been tested with experimental data.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132071912","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723842
Vikram Arkalgud Chandrasetty, S. M. Aziz
Implementation of partially-parallel (Low-Density Parity-Check) LDPC decoders using unstructured random matrices is very complex and requires huge hardware resources. To alleviate the complexity and minimize resource requirements, structured LDPC matrices are used. This paper presents a novel technique for constructing a multi-level Hierarchical Quasi-Cyclic (HQC) structured matrix for LDPC decoders. A unique multi-level structure of the proposed matrix provides flexibility in generating different code lengths and code rates for various applications such as WiMAX, WLAN and DVB-S2. In addition, different combinations of permuted sub-matrices are inserted in layers, to provide virtual randomness in the LDPC matrix. Simulations results show that the HQC matrices generated using the proposed technique have a marginal loss of less than 0.1 dB at a bit error rate (BER) performance of 10−5, compared to unstructured random matrices. The proposed matrix therefore provides BER performance close to random matrices while significantly reducing hardware resource requirements.
{"title":"Construction of a multi-level Hierarchical Quasi-Cyclic matrix with layered permutation for partially-parallel LDPC decoders","authors":"Vikram Arkalgud Chandrasetty, S. M. Aziz","doi":"10.1109/ICCITECHN.2010.5723842","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723842","url":null,"abstract":"Implementation of partially-parallel (Low-Density Parity-Check) LDPC decoders using unstructured random matrices is very complex and requires huge hardware resources. To alleviate the complexity and minimize resource requirements, structured LDPC matrices are used. This paper presents a novel technique for constructing a multi-level Hierarchical Quasi-Cyclic (HQC) structured matrix for LDPC decoders. A unique multi-level structure of the proposed matrix provides flexibility in generating different code lengths and code rates for various applications such as WiMAX, WLAN and DVB-S2. In addition, different combinations of permuted sub-matrices are inserted in layers, to provide virtual randomness in the LDPC matrix. Simulations results show that the HQC matrices generated using the proposed technique have a marginal loss of less than 0.1 dB at a bit error rate (BER) performance of 10−5, compared to unstructured random matrices. The proposed matrix therefore provides BER performance close to random matrices while significantly reducing hardware resource requirements.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126823165","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723835
K. M. Azharul Hasan, Esmot Ara, F. Hoque, Jenifar Yasmin
In this paper we describe a multidimensional implementation scheme for developing English to Bangla dictionary using multidimensional Array. We have converted the string into an integer key and partitioned the keys based on number of letters a word. Multidimensional arrays are good to store dense data. It is hard to use multidimensional array for sparse data. We have compressed the sparse multidimensional array by computing the offset value. We found good results for storage and retrieval costs. Our proposed model is explained with sufficient example and performance analysis is described with experimental results. The proposed scheme shows superiority over traditional schemes.
{"title":"A multidimensional partitioning scheme for developing English to Bangla dictionary","authors":"K. M. Azharul Hasan, Esmot Ara, F. Hoque, Jenifar Yasmin","doi":"10.1109/ICCITECHN.2010.5723835","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723835","url":null,"abstract":"In this paper we describe a multidimensional implementation scheme for developing English to Bangla dictionary using multidimensional Array. We have converted the string into an integer key and partitioned the keys based on number of letters a word. Multidimensional arrays are good to store dense data. It is hard to use multidimensional array for sparse data. We have compressed the sparse multidimensional array by computing the offset value. We found good results for storage and retrieval costs. Our proposed model is explained with sufficient example and performance analysis is described with experimental results. The proposed scheme shows superiority over traditional schemes.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114314379","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723834
K. Hasan, Amit Mondal, Amit Saha
Parsing is a process of transforming natural language into an internal system representation, which can be trees, dependency graphs, frames or some other structural representations. If a natural language be successfully parsed then grammar checking from this language becomes easy. In this paper we describe a context free grammar for Bangla language and hence we develop a Bangla parser based on the grammar. Our approach is very much general to apply in Bangla Sentences and the method is well accepted for parsing a language of a grammar. The scheme is based on Top down parsing method and to avoid the left recursion the idea of left factoring is adopted.
{"title":"A context free grammar and its predictive parser for bangla grammar recognition","authors":"K. Hasan, Amit Mondal, Amit Saha","doi":"10.1109/ICCITECHN.2010.5723834","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723834","url":null,"abstract":"Parsing is a process of transforming natural language into an internal system representation, which can be trees, dependency graphs, frames or some other structural representations. If a natural language be successfully parsed then grammar checking from this language becomes easy. In this paper we describe a context free grammar for Bangla language and hence we develop a Bangla parser based on the grammar. Our approach is very much general to apply in Bangla Sentences and the method is well accepted for parsing a language of a grammar. The scheme is based on Top down parsing method and to avoid the left recursion the idea of left factoring is adopted.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114371340","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：