Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579426
K. Roy, P. Bhattacharya, R. Debnath
We propose an improved iris recognition method to identify the person accurately by using a novel iris segmentation scheme based on the chain code and the collarette area localization. The collarette area is isolated as a personal identification pattern, which captures only the most important areas of iris complex structures, and a better recognition accuracy is achieved. The idea to use the collarette area is that it is less sensitive to the pupil dilation and usually not affected by the eyelids or the eyelashes. The deterministic feature sequence is extracted from the iris images using the 1D log-Gabor wavelet technique and used to train the support vector machine (SVM) as iris pattern classifiers. The parameters of SVM are tuned to improve the overall system performance. Our experimental results also indicate that the performance of SVM as a classifier is far better than the performance of backpropagation neural network (BPNN), K-nearest neighbor (KNN), Hamming distance and Mahalanobis distances. The proposed innovative technique is computationally effective as well as reliable in term of recognition rate of 99.56%.
{"title":"Multi-class SVM based iris recognition","authors":"K. Roy, P. Bhattacharya, R. Debnath","doi":"10.1109/ICCITECHN.2007.4579426","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579426","url":null,"abstract":"We propose an improved iris recognition method to identify the person accurately by using a novel iris segmentation scheme based on the chain code and the collarette area localization. The collarette area is isolated as a personal identification pattern, which captures only the most important areas of iris complex structures, and a better recognition accuracy is achieved. The idea to use the collarette area is that it is less sensitive to the pupil dilation and usually not affected by the eyelids or the eyelashes. The deterministic feature sequence is extracted from the iris images using the 1D log-Gabor wavelet technique and used to train the support vector machine (SVM) as iris pattern classifiers. The parameters of SVM are tuned to improve the overall system performance. Our experimental results also indicate that the performance of SVM as a classifier is far better than the performance of backpropagation neural network (BPNN), K-nearest neighbor (KNN), Hamming distance and Mahalanobis distances. The proposed innovative technique is computationally effective as well as reliable in term of recognition rate of 99.56%.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121036291","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 : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579393
M.A. Rahman, M. Alam
The k-arbiter is a well-established solution for the problem of the h-out of-k mutual exclusion. Though the solution using k-arbiters are simple and highly fault tolerant, the size of the quorums is high comparing to that of 1-coteries and for large values of k it becomes worse. A k-arbiter needs to have intersection between any k+1 quorums. Here we propose k(h)-arbiter, an efficient and general solution, for the h-out of-k mutual exclusion problems. It is an extension to k-arbiter. Here the quorum construction, using k-arbiters, considers h. The quorum size is variable and inversely proportional to the value of h for a specific value of k. The quorum size is smaller than that of k-arbiters for hGt1. We apply this technique on two simple k-arbiter construction schemes, uniform k-arbiter and binomial k-arbiter.
{"title":"A scheme for the solutions of the h-out of-k mutual exclusion problems using k-arbiters","authors":"M.A. Rahman, M. Alam","doi":"10.1109/ICCITECHN.2007.4579393","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579393","url":null,"abstract":"The k-arbiter is a well-established solution for the problem of the h-out of-k mutual exclusion. Though the solution using k-arbiters are simple and highly fault tolerant, the size of the quorums is high comparing to that of 1-coteries and for large values of k it becomes worse. A k-arbiter needs to have intersection between any k+1 quorums. Here we propose k(h)-arbiter, an efficient and general solution, for the h-out of-k mutual exclusion problems. It is an extension to k-arbiter. Here the quorum construction, using k-arbiters, considers h. The quorum size is variable and inversely proportional to the value of h for a specific value of k. The quorum size is smaller than that of k-arbiters for hGt1. We apply this technique on two simple k-arbiter construction schemes, uniform k-arbiter and binomial k-arbiter.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123263124","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 : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579418
M.R. Islam, M. Hasan, M.R. Alam, M. Rukunuzzaman
This paper presents an overview of the currently employed AVRs (Automatic Voltage Regulators), the analogue and the digital, microprocessor based sampled data controlled, devices with respect to their control systems. The main design aims and constraints are examined in terms of performance specification concerning the speed, accuracy and stability of control. The contradiction between transient and dynamic stability requirements and its present day resolution by introducing Power System Stabilizing function into the AVR functions is explained. The design is implemented and tested on a 110 W synchronous generator in Power System Laboratory with an IBM personal computer acting as the real time controller. The results show that the proposed PC-based AVR are very effective for operation of a controller. These include its low cost, fast response, higher reliability and ruggedness.
{"title":"Design and implementation of PC-based high performance automatic voltage regulator","authors":"M.R. Islam, M. Hasan, M.R. Alam, M. Rukunuzzaman","doi":"10.1109/ICCITECHN.2007.4579418","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579418","url":null,"abstract":"This paper presents an overview of the currently employed AVRs (Automatic Voltage Regulators), the analogue and the digital, microprocessor based sampled data controlled, devices with respect to their control systems. The main design aims and constraints are examined in terms of performance specification concerning the speed, accuracy and stability of control. The contradiction between transient and dynamic stability requirements and its present day resolution by introducing Power System Stabilizing function into the AVR functions is explained. The design is implemented and tested on a 110 W synchronous generator in Power System Laboratory with an IBM personal computer acting as the real time controller. The results show that the proposed PC-based AVR are very effective for operation of a controller. These include its low cost, fast response, higher reliability and ruggedness.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122690566","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 : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579446
M. Abdur Razzak, Fatou Ndiaye, Omar Khayam, Abdul Jabbar
In this paper, the performances of M-ary modulation schemes (MPSK, MQAM and MFSK) are analyzed in terms of symbol error probability as a function of SNR per bit. The channel capacity in terms of bit rate per bandwidth is also investigated to analyze the performance. In this constraint, the mathematical expressions for error probability in a closed form are derived using bounds and approximations to calculate and compare the performance of different modulation schemes theoretically. Simulation results for symbol error probability are also obtained using Monte Carlo method with 10% accuracy. Then the simulated results are compared with those of the theoretical calculations. A very good agreement is found between them.
{"title":"On the performance of M-ary modulation schemes for efficient communication systems","authors":"M. Abdur Razzak, Fatou Ndiaye, Omar Khayam, Abdul Jabbar","doi":"10.1109/ICCITECHN.2007.4579446","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579446","url":null,"abstract":"In this paper, the performances of M-ary modulation schemes (MPSK, MQAM and MFSK) are analyzed in terms of symbol error probability as a function of SNR per bit. The channel capacity in terms of bit rate per bandwidth is also investigated to analyze the performance. In this constraint, the mathematical expressions for error probability in a closed form are derived using bounds and approximations to calculate and compare the performance of different modulation schemes theoretically. Simulation results for symbol error probability are also obtained using Monte Carlo method with 10% accuracy. Then the simulated results are compared with those of the theoretical calculations. A very good agreement is found between them.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129732811","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 : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579353
Rumana Nazmul, A. Chowdhury, S. M. Tareeq
Motif finding is one of the most important and challenging tasks in computational biology. In this paper, a new algorithm for finding motif is presented. The strategy used in this paper speeds up the operations of finding the motif. Performance comparisons among the existing algorithms and proposed algorithm are also presented which shows that the proposed algorithm performs better in terms of accuracy and time complexity.
{"title":"A novel approach of finding planted motif in biological sequences","authors":"Rumana Nazmul, A. Chowdhury, S. M. Tareeq","doi":"10.1109/ICCITECHN.2007.4579353","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579353","url":null,"abstract":"Motif finding is one of the most important and challenging tasks in computational biology. In this paper, a new algorithm for finding motif is presented. The strategy used in this paper speeds up the operations of finding the motif. Performance comparisons among the existing algorithms and proposed algorithm are also presented which shows that the proposed algorithm performs better in terms of accuracy and time complexity.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121494664","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 : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579371
A. Arefin, M.A. Kashem Mia
The minimum edge-ranking spanning tree (MERST) problem on a graph is to find a spanning tree of G whose edge-ranking needs least number of ranks. Although polynomial-time algorithm to solve the minimum edge-ranking spanning tree problem on series-parallel graphs with bounded degrees has been found, but for the unbounded degrees no polynomial-time algorithm is known. In this paper, we prove that the minimum edge-ranking spanning tree problem on general series-parallel graph is NP-complete.
{"title":"NP-Completeness of the minimum edge-ranking spanning tree problem on series-parallel graphs","authors":"A. Arefin, M.A. Kashem Mia","doi":"10.1109/ICCITECHN.2007.4579371","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579371","url":null,"abstract":"The minimum edge-ranking spanning tree (MERST) problem on a graph is to find a spanning tree of G whose edge-ranking needs least number of ranks. Although polynomial-time algorithm to solve the minimum edge-ranking spanning tree problem on series-parallel graphs with bounded degrees has been found, but for the unbounded degrees no polynomial-time algorithm is known. In this paper, we prove that the minimum edge-ranking spanning tree problem on general series-parallel graph is NP-complete.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130740474","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 : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579386
A. Al-kaisan, M. Ashrafuzzaman, S. Ahsan
The Internetpsilas excellent scalability and robustness result in part from the end-to-end nature of Internet congestion control. End-to-end congestion control algorithms alone however are unable to prevent the congestion collapse and unfairness created by applications that are unresponsive to network congestion. To address these maladies, we propose a modified Queue Management algorithm and Stream Control Transmission Protocol (SCTP) congestion control mechanism. SCTP mechanisms are based upon TCP congestion control principles. It allows network operators to simultaneously achieve high throughput and low average delay. One of the flaws of SCTP is-fast retransmission procedure is vulnerable to being mistakenly triggered multiple times leading to under utilization of the network during recovery and duplicate retransmissions of the lost packet. To solve these problems, we change in determining the congestion window while leaving the basic idea intact and then evaluate its performance using simulation. Simulation results show that our proposed method can effectively eliminates congestion collapse and give better performance than conventional procedure. Based on extensive simulation, we believe that our technique is sufficiently robust for deployment in routers.
{"title":"Reducing congestion collapse and promoting fairness in the internet by optimizing SCTP","authors":"A. Al-kaisan, M. Ashrafuzzaman, S. Ahsan","doi":"10.1109/ICCITECHN.2007.4579386","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579386","url":null,"abstract":"The Internetpsilas excellent scalability and robustness result in part from the end-to-end nature of Internet congestion control. End-to-end congestion control algorithms alone however are unable to prevent the congestion collapse and unfairness created by applications that are unresponsive to network congestion. To address these maladies, we propose a modified Queue Management algorithm and Stream Control Transmission Protocol (SCTP) congestion control mechanism. SCTP mechanisms are based upon TCP congestion control principles. It allows network operators to simultaneously achieve high throughput and low average delay. One of the flaws of SCTP is-fast retransmission procedure is vulnerable to being mistakenly triggered multiple times leading to under utilization of the network during recovery and duplicate retransmissions of the lost packet. To solve these problems, we change in determining the congestion window while leaving the basic idea intact and then evaluate its performance using simulation. Simulation results show that our proposed method can effectively eliminates congestion collapse and give better performance than conventional procedure. Based on extensive simulation, we believe that our technique is sufficiently robust for deployment in routers.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132825666","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 : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579407
A. M. Dewan, S. Nazmin
The potential contribution of information and communication technology (ICT) to improve the competitiveness of small and medium-sized enterprises (SMEs) has long been recognised. However, the realisation of this potential has been problematic and over recent years there have been a number of initiatives supported by government, non government and foreign agencies which have endeavoured to aid and encourage the up take of ICT to enable access to such promised benefits. Despite strong theoretical arguments suggesting that ICT has much to offer to SMEs, the study would seem to suggest that use of ICT by SMEs in Bangladesh Small and Cottage Industries Corporationpsilas (BSCIC) 70 industrial estates is still in its infancy. One of the factors that have been identified as impacting upon the level of ICT adoption amongst SMEs is access to, and confidence on ICT. This paper is based on the study conducted as part of the IDA funded enterprise growth and bank modernization project and explores the opportunities and potentials of using ICT to provide a necessary lever to enhance competitiveness and productivity of SMEs in Bangladesh.
{"title":"The opportunities of using ICT by small and medium enterprises in Bangladesh: Case of SMEs in Bangladesh Small & Cottage Industries Corporation’s industrial estates","authors":"A. M. Dewan, S. Nazmin","doi":"10.1109/ICCITECHN.2007.4579407","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579407","url":null,"abstract":"The potential contribution of information and communication technology (ICT) to improve the competitiveness of small and medium-sized enterprises (SMEs) has long been recognised. However, the realisation of this potential has been problematic and over recent years there have been a number of initiatives supported by government, non government and foreign agencies which have endeavoured to aid and encourage the up take of ICT to enable access to such promised benefits. Despite strong theoretical arguments suggesting that ICT has much to offer to SMEs, the study would seem to suggest that use of ICT by SMEs in Bangladesh Small and Cottage Industries Corporationpsilas (BSCIC) 70 industrial estates is still in its infancy. One of the factors that have been identified as impacting upon the level of ICT adoption amongst SMEs is access to, and confidence on ICT. This paper is based on the study conducted as part of the IDA funded enterprise growth and bank modernization project and explores the opportunities and potentials of using ICT to provide a necessary lever to enhance competitiveness and productivity of SMEs in Bangladesh.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131425138","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 : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579392
M. Rahman, M. A. Hossan, M. Rahman, S. Horiguchi
In this paper, we present a new wide-sense nonblocking optical switching network. The proposed network combines some building blocks, which is All-To-All Personalized Exchange Multistage Interconnection Network. The architectural details and some other parameters are evaluated and compared with other networks to show the superiority of the proposed network over other networks. To construct the proposed network we require less number of switching elements. In addition, it provides constant first order crosstalk, thus it scales well. The proposed network is a good choice for constructing nonblocking optical switch with less switching element and signal loss.
{"title":"A new wide-sense nonblocking optical switching network","authors":"M. Rahman, M. A. Hossan, M. Rahman, S. Horiguchi","doi":"10.1109/ICCITECHN.2007.4579392","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579392","url":null,"abstract":"In this paper, we present a new wide-sense nonblocking optical switching network. The proposed network combines some building blocks, which is All-To-All Personalized Exchange Multistage Interconnection Network. The architectural details and some other parameters are evaluated and compared with other networks to show the superiority of the proposed network over other networks. To construct the proposed network we require less number of switching elements. In addition, it provides constant first order crosstalk, thus it scales well. The proposed network is a good choice for constructing nonblocking optical switch with less switching element and signal loss.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115577063","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 : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579357
Shafiq R. Joty, S. Sadid-Al-Hasan
When a user is served with a ranked list of relevant documents by the standard document retrieval systems (i.e. search engines), his search task is usually not over. The next step for him is to look into the documents themselves in search for the precise piece of information he was looking for. This method is time consuming, and a correct answer could easily be missed, by either an incorrect query resulting in missing documents or by careless reading. Focused retrieval tries to remove the onus on the end-user, by providing more direct access to relevant information. Focused retrieval is becoming increasingly important in all areas of information retrieval. In this paper we investigate the various aspects of focused retrieval.
{"title":"Advances in focused retrieval: A general review","authors":"Shafiq R. Joty, S. Sadid-Al-Hasan","doi":"10.1109/ICCITECHN.2007.4579357","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579357","url":null,"abstract":"When a user is served with a ranked list of relevant documents by the standard document retrieval systems (i.e. search engines), his search task is usually not over. The next step for him is to look into the documents themselves in search for the precise piece of information he was looking for. This method is time consuming, and a correct answer could easily be missed, by either an incorrect query resulting in missing documents or by careless reading. Focused retrieval tries to remove the onus on the end-user, by providing more direct access to relevant information. Focused retrieval is becoming increasingly important in all areas of information retrieval. In this paper we investigate the various aspects of focused retrieval.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114547021","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
扫码关注我们
求助内容：
应助结果提醒方式：