2009 12th International Conference on Computers and Information Technology最新文献_第6页

Development of a translation model from HTML to WML using component based information extraction technique 利用基于组件的信息提取技术开发HTML到WML的翻译模型

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407260

Md. Ashik Khan, Md Liakot Ali

引用次数: 5

Speaker identification system using PCA & eigenface 基于PCA和特征脸的说话人识别系统

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407129

Md. Rashedul Islam, M. S. Azam, Saleh Ahmed

引用次数: 1

On the fast computation of decimal logarithm 关于十进制对数的快速计算

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407171

Ramin Tajallipour, D. Teng, S. Ko, K. Wahid

引用次数: 7

Performance analysis of a novel fuzzy logic and MTPA based speed control for IPMSM drive with variable d- and q-axis inductances 一种基于模糊逻辑和MTPA的可变d轴和q轴电感永磁同步电机转速控制的性能分析

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407264

Md. Selim Hossain, Md. Jahangir Hossain

引用次数: 7

Design of quaternary sequential circuits using a newly proposed quaternary algebra 用新提出的四元代数设计四元顺序电路

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407139

I. Jahangir, D. Hasan, Nahian Alam Siddique, Shajid Islam, Mehedi Hasan

引用次数: 11

A compact loop type antenna for millimeter band applications 一种用于毫米波段应用的紧凑型环形天线

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407155

K. Banerjee, A. Numan-Al-Mobin, K. M. Morshed

引用次数: 0

Fair slots assignment mechanisms of IEEE 802.11 networks for multiple access points IEEE 802.11网络多接入点公平插槽分配机制

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407158

G. Ali, R. Shahin, Nushrika Mowna

{"title":"Fair slots assignment mechanisms of IEEE 802.11 networks for multiple access points","authors":"G. Ali, R. Shahin, Nushrika Mowna","doi":"10.1109/ICCIT.2009.5407158","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407158","url":null,"abstract":"This paper is a research work to find out an efficient algorithm for slots assignments of multiple access points (APs) of IEEE 802.11 wireless LANs in a framework for seeking an approach which balances between quality of services (QoS) and fairness while achieving maximum network throughput. The explosive growth of wireless systems coupled with the extensive use of laptop and palmtop computers indicate bright future for wireless networks both as standalone systems and as part of large networking infrastructure. IEEE 802.11 wireless LAN has been improving in terms of data rates, radio services, security etc. ever since. Now-a-days WLAN is an essential part for providing both real time and non-real time services to a massive mobile users. But there are still lacking for WLAN to provide both QoS guarantee and fairness which makes it inappropriate for real time applications such as voice and video services. We analyze for a new framework which based on centralized coordination of APs, is a complementary to the emerging 802.11e standard for QoS and guarantee to overcome the hidden node and overlapping cell problems. We simulate three algorithms for slots assignment of multiple APs during contention-free period (CFP) of IEEE 802.11 point coordination function (PCF) medium access control (MAC) mode for ensuring the QoS, inter-AP fairness with maximizing the network throughput.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"141-142 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":"124034990","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}

引用次数: 0

A new image compression scheme using repeat reduction and arithmetic coding 一种利用重复约简和算术编码的图像压缩新方案

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407138

M. Islam, Abdullah-Al Baki, Md. Shahidul Haque Palash

引用次数: 3

Performance evaluation of heterogeneous network for next generation mobile 下一代移动异构网络性能评价

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407157

A. Chowdhury, M. Gregory

引用次数: 5

Heuristic algorithm of the multiple-choice multidimensional knapsack problem (MMKP) for cluster computing 多选择多维背包问题的启发式算法

2009 12th International Conference on Computers and Information Technology Pub Date : 2009-12-01 DOI: 10.1109/ICCIT.2009.5407147

Md Iftakharul Islam, M. Akbar

{"title":"Heuristic algorithm of the multiple-choice multidimensional knapsack problem (MMKP) for cluster computing","authors":"Md Iftakharul Islam, M. Akbar","doi":"10.1109/ICCIT.2009.5407147","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407147","url":null,"abstract":"This paper presents two heuristic algorithms of the MMKP (a variant of 0–1 knapsack problem) for cluster computing. We present an architecture of a cluster, such that algorithm requires small message passing. The algorithms divide the problem among computational nodes. Each node solves its sub problem using a sequential heuristic. This naïve divide and conquer approach cannot achieve good revenue. The revenue is the value achieved by the solution of MMKP. To improve the revenue, it accumulates the unused resources from every node, and assigns to the node, which gives maximum revenue over all nodes. This is the residue exploitation (RE) strategy. The solution quality can be improved by a novel resource-division policy rather than equal division. The policy divides the resource among all nodes such that total revenue increases. A sequential heuristic calculates the solution incrementally for different amounts of resource capacity, and the best combination is taken as the solution. This is the resource adjustment (RA) strategy. We experiment the algorithm using MPI (Message Passing Interface). The proposed algorithms show encouraging results.","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":"115352196","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}

引用次数: 8