Rule extraction aims to ultimately improve business performance through an understanding of past and present search histories of customers. A challenging task is to determine interesting rules from their heterogeneous search histories of shopping in the Internet. For this purpose Neural Network (NN) and Canonical Correlation Analysis (CCA) are used. Customers visit web pages one after another and leave their valuable search information behind. Firstly we produce a homogeneous data set from their heterogeneous search histories. It is difficult task to produce a homogeneous data from heterogeneous data without changing their characteristics of data. Secondly these data are trained by unsupervised NN to get their significant class. Thirdly we extract the maximally correlated customers by using CCA and then interesting rules are extracted among their maximally correlated customer. This is important for the traders, marketers and customers for making future business plan.
{"title":"Extraction of interesting rules from internet search histories","authors":"M. Asaduzzaman, M. Shahjahan, K. Murase","doi":"10.4304/JSW.6.1.10-19","DOIUrl":"https://doi.org/10.4304/JSW.6.1.10-19","url":null,"abstract":"Rule extraction aims to ultimately improve business performance through an understanding of past and present search histories of customers. A challenging task is to determine interesting rules from their heterogeneous search histories of shopping in the Internet. For this purpose Neural Network (NN) and Canonical Correlation Analysis (CCA) are used. Customers visit web pages one after another and leave their valuable search information behind. Firstly we produce a homogeneous data set from their heterogeneous search histories. It is difficult task to produce a homogeneous data from heterogeneous data without changing their characteristics of data. Secondly these data are trained by unsupervised NN to get their significant class. Thirdly we extract the maximally correlated customers by using CCA and then interesting rules are extracted among their maximally correlated customer. This is important for the traders, marketers and customers for making future business plan.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129096770","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}
Video coding is a process for representing video sequences in a compact manner. A significant step in video coding is searching for similar segments in previous frames and use only the difference information for reconstruction thus reducing space requirement. Different search techniques including Full search and 2-D logarithmic search etc. are used in the current literature. Full search restricts its application because of its computational load. 2D logarithmic search is computationally less expensive although there are some spaces for improvement. In this paper we propose a new search technique by modifying the 2-D logarithmic search that requires less search points with insignificant loss in visual quality. Experimental results demonstrate the effectiveness of the proposed technique.
{"title":"A modified 2-D logarithmic search technique for video coding with reduced search points","authors":"Tahmina Akhtar, Rahima Akter, Ch. Chhaya, Ashfaqur Rahman","doi":"10.1109/ICCIT.2009.5407136","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407136","url":null,"abstract":"Video coding is a process for representing video sequences in a compact manner. A significant step in video coding is searching for similar segments in previous frames and use only the difference information for reconstruction thus reducing space requirement. Different search techniques including Full search and 2-D logarithmic search etc. are used in the current literature. Full search restricts its application because of its computational load. 2D logarithmic search is computationally less expensive although there are some spaces for improvement. In this paper we propose a new search technique by modifying the 2-D logarithmic search that requires less search points with insignificant loss in visual quality. Experimental results demonstrate the effectiveness of the proposed technique.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"23 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122440470","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407146
M. Rahman, Muhammad F. I. Chowdhury
The multiprocessor task graph scheduling problem has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer. The problem is already being known as one of the NP-hard problems. There are many good approaches made with many optimizing algorithm to find out the optimum solution for this problem with less computational time. One of them is branch and bound algorithm. In this paper, we studied the branch and bound algorithm for the multiprocessor scheduling problem.
{"title":"Examining branch and bound strategy on multiprocessor task scheduling","authors":"M. Rahman, Muhammad F. I. Chowdhury","doi":"10.1109/ICCIT.2009.5407146","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407146","url":null,"abstract":"The multiprocessor task graph scheduling problem has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer. The problem is already being known as one of the NP-hard problems. There are many good approaches made with many optimizing algorithm to find out the optimum solution for this problem with less computational time. One of them is branch and bound algorithm. In this paper, we studied the branch and bound algorithm for the multiprocessor scheduling problem.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116204584","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407135
M. Rashid, Md. Akter Hussain, M. S. Rahman
This paper presents methodologies involved in diphone preparation for Bangla text to speech synthesis. A concatenation based synthesis system comprises basically two modules- one is natural language processing and other is digital signal processing (DSP). Natural language processing implies converting text to its pronounceable text, called text normalization and the diphone selection method based on the normalized text is called Graphene to Phoneme (G2P) conversion. We developed a speech synthesizer for Bangla using diphone based concatenative approach. Diphone preparation, labeling and selection techniques are described in this paper.
{"title":"Diphone preparation for Bangla text to speech synthesis","authors":"M. Rashid, Md. Akter Hussain, M. S. Rahman","doi":"10.1109/ICCIT.2009.5407135","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407135","url":null,"abstract":"This paper presents methodologies involved in diphone preparation for Bangla text to speech synthesis. A concatenation based synthesis system comprises basically two modules- one is natural language processing and other is digital signal processing (DSP). Natural language processing implies converting text to its pronounceable text, called text normalization and the diphone selection method based on the normalized text is called Graphene to Phoneme (G2P) conversion. We developed a speech synthesizer for Bangla using diphone based concatenative approach. Diphone preparation, labeling and selection techniques are described in this paper.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126208368","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407324
Sifatur Rahim, S. Hasan
Although TCP is one of the key protocols of the Internet infrastructure, it is not optimized for either wireless environment or multimedia streaming applications. It fails to meet the service requirement of streaming applications because of its strict adherence to congestion control. Besides, non-congestion packet loss fools TCP to slow down its sending rate over wireless links. Fast TCP and TCP Westwood+ are two well known TCP variants which are supposed to resolve these problems. This paper analyzes the performance of TCP Westwood+ and Fast TCP for various issues in wireless network for multimedia streaming. Simulation results show that, Fast TCP shows better goodput, average throughput, and fairness index but TCP Westwood+ shows less jitter and better performance in presence of heavy reverse flows.
{"title":"Performance evaluation of fast TCP and TCP Westwood+ for multimedia streaming in wireless environment","authors":"Sifatur Rahim, S. Hasan","doi":"10.1109/ICCIT.2009.5407324","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407324","url":null,"abstract":"Although TCP is one of the key protocols of the Internet infrastructure, it is not optimized for either wireless environment or multimedia streaming applications. It fails to meet the service requirement of streaming applications because of its strict adherence to congestion control. Besides, non-congestion packet loss fools TCP to slow down its sending rate over wireless links. Fast TCP and TCP Westwood+ are two well known TCP variants which are supposed to resolve these problems. This paper analyzes the performance of TCP Westwood+ and Fast TCP for various issues in wireless network for multimedia streaming. Simulation results show that, Fast TCP shows better goodput, average throughput, and fairness index but TCP Westwood+ shows less jitter and better performance in presence of heavy reverse flows.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125702707","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407299
Abu Moen Mohammad Salah Uddin, M. I. Monir, S. Iqbal
To truly realize potential of MANET, multimedia services must be provisioned with a minimum level of QoS. To meet the QoS requirement of such services, many attributes need to be considered. To keep the routing process lightweight, standard QoS aware routing protocol in MANET works with one or two such parameters. In this paper, we have proposed an on-demand source routing protocol for MANET that works with six important QoS attributes by varying priority for different category of traffic flow. We have reflected this variation by incorporating Analytic Hierarchy Process in the proposal.
{"title":"A QoS aware route selection mechanism using Analytic Hierarchy Process for Mobile Ad Hoc Network","authors":"Abu Moen Mohammad Salah Uddin, M. I. Monir, S. Iqbal","doi":"10.1109/ICCIT.2009.5407299","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407299","url":null,"abstract":"To truly realize potential of MANET, multimedia services must be provisioned with a minimum level of QoS. To meet the QoS requirement of such services, many attributes need to be considered. To keep the routing process lightweight, standard QoS aware routing protocol in MANET works with one or two such parameters. In this paper, we have proposed an on-demand source routing protocol for MANET that works with six important QoS attributes by varying priority for different category of traffic flow. We have reflected this variation by incorporating Analytic Hierarchy Process in the proposal.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125970981","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407153
Saifullah M. Dewan, A. M. Dewan
With banking channels changing rapidly and multi-channeling becoming increasingly widespread, there is a need to understand consumers' choice of channel and the banking tasks for the channel. Using the example of banking services in urban Bangladesh, where multichanneling is expected to become a norm, this research reports on an initial study comparing young consumers' choice of banking channels. Based on the results of a survey among 500 young adults between 18 and 30 years of age in Dhaka city, this study finds that although majority of the respondents did not use mobile banking (m-banking), most of them are interested to do banking on mobile phones. They are interested to do a range of banking related tasks on mobile phones if services are made available. Clearly young consumers in urban Bangladesh are in favour of m-banking and thus, m-banking has a chance to be a success story in Bangladesh.
{"title":"Young consumers' m-banking choice in urban Bangladesh: Preliminary indication","authors":"Saifullah M. Dewan, A. M. Dewan","doi":"10.1109/ICCIT.2009.5407153","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407153","url":null,"abstract":"With banking channels changing rapidly and multi-channeling becoming increasingly widespread, there is a need to understand consumers' choice of channel and the banking tasks for the channel. Using the example of banking services in urban Bangladesh, where multichanneling is expected to become a norm, this research reports on an initial study comparing young consumers' choice of banking channels. Based on the results of a survey among 500 young adults between 18 and 30 years of age in Dhaka city, this study finds that although majority of the respondents did not use mobile banking (m-banking), most of them are interested to do banking on mobile phones. They are interested to do a range of banking related tasks on mobile phones if services are made available. Clearly young consumers in urban Bangladesh are in favour of m-banking and thus, m-banking has a chance to be a success story in Bangladesh.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128365414","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407293
Adnan Quaium, Ahmed Latif Shahriar, M. Rokonuzzaman
This study introduces process centric Work Breakdown Structure (WBS) for managing challenges for coding phase of software development cycle. The approach represents WBS as a process centric view to understand the inter relationships and dependencies between activities. Suggested WBS reduces complexities and gaps of the project plan and its execution by early simulation of diverse coding activities through process centric view. It is believed that such process centric approach instead of tree form representation of WBS will improve the visibility of coding process during planning stage for increasing the accuracy of estimation, resource loading, and progress monitoring.
{"title":"Process centric Work Breakdown Structure of software coding for improving accuracy of estimation, resource loading and progress monitoring of code development","authors":"Adnan Quaium, Ahmed Latif Shahriar, M. Rokonuzzaman","doi":"10.1109/ICCIT.2009.5407293","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407293","url":null,"abstract":"This study introduces process centric Work Breakdown Structure (WBS) for managing challenges for coding phase of software development cycle. The approach represents WBS as a process centric view to understand the inter relationships and dependencies between activities. Suggested WBS reduces complexities and gaps of the project plan and its execution by early simulation of diverse coding activities through process centric view. It is believed that such process centric approach instead of tree form representation of WBS will improve the visibility of coding process during planning stage for increasing the accuracy of estimation, resource loading, and progress monitoring.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131374881","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407294
A. Mamun, S. Islam, F. Yesmin, M. Akter, Shaikh Afsana Jahan
Power control is an essential radio resource management method in CDMA cellular communication systems, where co-channel and adjacent-channel interferences are the primary capacity limiting factors. Power control intends to control the transmission power levels in such a way that required quality of service for the users is guaranteed with lowest possible transmission powers. In this paper, a modulation of power control algorithm is proposed for the 3G WCDMA system. The algorithm is figured on a modification of the transmitted power update step size. Instead of the fixed value presently suggested, the step size is modified dynamically in order to obtain more adapted power variations as well as the step is also represented as a function of the difference between the target and estimated SIR of the MS to obtain more stability of the system. A general form of this algorithm is presented and it is then studied in a simple simulation. Performance of the algorithm was evaluated with the outage percentage, which is the percentage of the number of MS's whose received SIR falls below the fixed threshold. The focused requirement, which had been tried to achieve by this algorithm, is the stability, which was studied and represented through simulation.
{"title":"Novel Adaptive Step Power Control algorithm for 3G WCDMA cellular system","authors":"A. Mamun, S. Islam, F. Yesmin, M. Akter, Shaikh Afsana Jahan","doi":"10.1109/ICCIT.2009.5407294","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407294","url":null,"abstract":"Power control is an essential radio resource management method in CDMA cellular communication systems, where co-channel and adjacent-channel interferences are the primary capacity limiting factors. Power control intends to control the transmission power levels in such a way that required quality of service for the users is guaranteed with lowest possible transmission powers. In this paper, a modulation of power control algorithm is proposed for the 3G WCDMA system. The algorithm is figured on a modification of the transmitted power update step size. Instead of the fixed value presently suggested, the step size is modified dynamically in order to obtain more adapted power variations as well as the step is also represented as a function of the difference between the target and estimated SIR of the MS to obtain more stability of the system. A general form of this algorithm is presented and it is then studied in a simple simulation. Performance of the algorithm was evaluated with the outage percentage, which is the percentage of the number of MS's whose received SIR falls below the fixed threshold. The focused requirement, which had been tried to achieve by this algorithm, is the stability, which was studied and represented through simulation.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132534597","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407312
Kaafi Mahmud Sarker, I. Jahan, Mohammad Zahidur Rahman
Association of a true observer guaranties electronic cash not to be double-spent by any means. Java card is a smartcard which represents one of the smallest computing platforms. A major challenge influencing the design and implementation of e-cash observer in Java card is the limited availability of computing resources in it. In this paper, we show a new methodology of blending and associating high-level CORBA based bank server, user wallets and resource-constrained Java based observer. We choose a realistic e-cash scheme and show its successful implementation. We also analyze performance of Java card with various lengths of secret keys used for generating electronic coins.
{"title":"Secure e-cash model using Java based smartcard","authors":"Kaafi Mahmud Sarker, I. Jahan, Mohammad Zahidur Rahman","doi":"10.1109/ICCIT.2009.5407312","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407312","url":null,"abstract":"Association of a true observer guaranties electronic cash not to be double-spent by any means. Java card is a smartcard which represents one of the smallest computing platforms. A major challenge influencing the design and implementation of e-cash observer in Java card is the limited availability of computing resources in it. In this paper, we show a new methodology of blending and associating high-level CORBA based bank server, user wallets and resource-constrained Java based observer. We choose a realistic e-cash scheme and show its successful implementation. We also analyze performance of Java card with various lengths of secret keys used for generating electronic coins.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"92 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132694307","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
扫码关注我们
求助内容：
应助结果提醒方式：