发布求助
文献互助 智能选刊 最新文献

2007 International Conference on Information and Communication Technology最新文献

筛选
英文 中文
Algorithms for Alignment of Co-Channel Speech Signals in Adaptive Speech Separation 自适应语音分离中同信道语音信号对齐算法
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375399
Nicholas J Cox, Christopher J. Page, Razvan F Petrescu, Syed Mahfuzul Aziz
{"title":"Algorithms for Alignment of Co-Channel Speech Signals in Adaptive Speech Separation","authors":"Nicholas J Cox, Christopher J. Page, Razvan F Petrescu, Syed Mahfuzul Aziz","doi":"10.1109/ICICT.2007.375399","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375399","url":null,"abstract":"This paper presents preprocessing algorithms for reducing misalignment of co-channel speech signals in order to improve the accuracy of adaptive speech separation. The use of adaptive decorrelation filtering as a front end processor in speech recognition systems improve performance when the input signals from the two channels are synchronized. However the performance of ADF is degraded when the co-channel signals are misaligned. We address this problem by proposing a pre-processor to the ADF with a view to align the co-channel signals. We have implemented two different algorithms for synchronizing the co-channel speech signals using cross-correlation. These algorithms improve the performance of speech recognition.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133858665","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
User Capacity of DS-CDMA Cellular Communication Systems Over A Nakagami-M Distributed Multi-Path Fading Channel Nakagami-M分布式多径衰落信道上DS-CDMA蜂窝通信系统的用户容量
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375376
M.F. Hossain, M. Nomani, S. Majumder
{"title":"User Capacity of DS-CDMA Cellular Communication Systems Over A Nakagami-M Distributed Multi-Path Fading Channel","authors":"M.F. Hossain, M. Nomani, S. Majumder","doi":"10.1109/ICICT.2007.375376","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375376","url":null,"abstract":"The user capacity of the reverse link of direct sequence code division multiple access (DS-CDMA) cellular wireless mobile communication systems over Nakagami-m distributed frequency selective multi-path fading channels with respect to both the voice and data communications has been evaluated in this paper. Effect of perfect and imperfect power control on the performance of the system is considered. It is observed that the system performance is quite satisfactory for both the voice communication and data communication.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122708101","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 Optical Spectral Amplitude Coding Sequence: Khazani-Syed (KS) Code 一种新的光谱幅度编码序列:Khazani-Syed (KS)码
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375391
M. Abdullah, S. Aljunid, S. Anas, R. Sahbudin, M. Mokhtar
{"title":"A New Optical Spectral Amplitude Coding Sequence: Khazani-Syed (KS) Code","authors":"M. Abdullah, S. Aljunid, S. Anas, R. Sahbudin, M. Mokhtar","doi":"10.1109/ICICT.2007.375391","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375391","url":null,"abstract":"Optical transmission technologies are known to provide very high speed data rate. This includes the popular multi-channel dense wavelength division multiplexing (DWDM) technology which allows a straight forward transmission bandwidth enhancement by increasing the number of channels.This, however, will no longer be enough in the near future when the user demands are are more dynamic. In the future, a more flexible optical technology is required. Optical code division multiplexing (OCDM) is highly considered as one of the candidates. The earlier generations of OCDM which was based on direct conversion from electrical to optical domain was complicated and impractical. However the advent of optical spectral amplitude coding (OSAC) scheme with simpler approach has revived the viability of this technology. Khazani-Syed is a new code proposed to overcome the limitations of existing codes at a reduced cost. This paper presents the properties of KS codes, their construction and the performance in comparison with other codes. The advantages of this new code are clearly shown in this paper.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127886821","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}
引用次数: 26
Effective Performance of External Sorting with No Additional Disk Space 没有额外磁盘空间的外部排序的有效性能
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375331
M. Islam, M.S. Sarker, S.R. Islam
{"title":"Effective Performance of External Sorting with No Additional Disk Space","authors":"M. Islam, M.S. Sarker, S.R. Islam","doi":"10.1109/ICICT.2007.375331","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375331","url":null,"abstract":"The efficiency of the external sorting is analyzed in terms of time and I/O complexities. In this paper we have presented a more effective external sorting algorithm, where both the time and output complexities have been reduced significantly and made the sorting faster. Both the time and output complexities of the proposed algorithm are analyzed here and compared with the complexities of existing algorithms. The proposed algorithm is notable in sorting a huge file, which is many times larger than the available main memory.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124151294","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
Security Attack Detection using Genetic Algorithm (GA) in Policy Based Network 策略网络中基于遗传算法的安全攻击检测
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375407
A. Alim, A. Islam, Md Khurshid Arifulazad, Md. Shamsul Alam, Alam
{"title":"Security Attack Detection using Genetic Algorithm (GA) in Policy Based Network","authors":"A. Alim, A. Islam, Md Khurshid Arifulazad, Md. Shamsul Alam, Alam","doi":"10.1109/ICICT.2007.375407","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375407","url":null,"abstract":"We present a modern approach of detecting the computer network security attacks (commonly termed as \"hacks\") by using an artificial intelligence method known as a genetic algorithm, which is a variant of stochastic beam search, which can be applied to a Policy Based Network. For this experiment, we develop the corresponding form of genetic algorithm and the form of fitness function to detect security attacks. Then we test the algorithm by a simulation program in TC (Turbo C) to gauge its effectiveness and the side effects of its execution. Finally, we give the indication for the necessary change in policy framework to deploy the functionality.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124675541","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}
引用次数: 6
Detection of Space-Time Cluster 时空簇的探测
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375360
I. Sikder, Joseph M. Woodside
{"title":"Detection of Space-Time Cluster","authors":"I. Sikder, Joseph M. Woodside","doi":"10.1109/ICICT.2007.375360","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375360","url":null,"abstract":"Detection of space-time cluster is an important aspect of spatial epidemiology and GIS-based data mining. This paper compares three clustering algorithm namely, scan statistic [1], local indicators of spatial autocorrelation (LISA) [2] and local G-statistic [3]. This study involves application of routine clinical service data collected by a Northeast Ohio healthcare organization in USA over a period 1994 -2006 to find excess space-time variations of lung cancer. Using empirical Byes adjustment of incidence rate, almost identical spatial pattern of clusters were detected by the three algorithms. However, the space-time scan statistics involving cylindrical search window shows somewhat different spatial localization. Finally, the study compares the effectiveness the different methods.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116466585","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
Fingerprint Recognition by Chain Coded String Matching Technique 基于链编码字符串匹配技术的指纹识别
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375343
R. Paul, M. Nasif, S. Farhad
{"title":"Fingerprint Recognition by Chain Coded String Matching Technique","authors":"R. Paul, M. Nasif, S. Farhad","doi":"10.1109/ICICT.2007.375343","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375343","url":null,"abstract":"Research in automated fingerprint recognition has been carried out for decades. But reliable and faster fingerprint recognition is still an open problem. Determination of features, encoding them and matching with template are the most challenging problems faced in this area. This paper introduces a novel approach of fingerprint recognition based on Flow Pattern and Chain Coded String Matching technique. In our technique, we propose to use string encoding of images from a Circular Tessellation for recognizing fingerprint data. This approach has a significant improvement in time complexity over the typical square tessellated and gray scale representation techniques.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131162821","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}
引用次数: 5
Coded Cooperation Diversity in Wireless Relay Network 无线中继网络中的编码合作分集
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375356
Asaduzzaman, H. Kong, Kim Nae Soo
{"title":"Coded Cooperation Diversity in Wireless Relay Network","authors":"Asaduzzaman, H. Kong, Kim Nae Soo","doi":"10.1109/ICICT.2007.375356","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375356","url":null,"abstract":"This paper studies the application of coded cooperation in wireless relay network. In wireless relay network only one user transmit data and the cooperative users assist the active user to get the spatial diversity. Exploit the idle time of active user we get the time diversity along with the spatial diversity. We investigate the rate compatible puncture convolutional (RCPC) code based coded cooperation in a wireless relay network where two relay cooperating with one active user. The effect of various channel conditions on the cooperation is also examined.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133955079","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}
引用次数: 3
An Algorithm for Finding Minimum Degree Spanning Tree of Series-Parallel Graphs 一种求序列-并行图最小度生成树的算法
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375336
M. A. Haque, R. Uddin, A. Kashem
{"title":"An Algorithm for Finding Minimum Degree Spanning Tree of Series-Parallel Graphs","authors":"M. A. Haque, R. Uddin, A. Kashem","doi":"10.1109/ICICT.2007.375336","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375336","url":null,"abstract":"A minimum degree spanning tree of a graph G is a spanning tree of G whose maximum degree is minimum among all spanning trees of G. The minimum degree spanning tree problem (MDST) is to construct such a spanning tree of a graph. In this paper, we propose a polynomial-time algorithm for solving the MDST problem on series-parallel graphs. Our algorithm runs in linear time for series-parallel graphs with small degrees. By applying this algorithm, we also give an approximation algorithm for solving the minimum edge-ranking spanning tree problem on series-parallel graphs.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132643922","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
High Efficiency InxGa1-xN-Based Multi-Junction Photo Voltaic Cells with Concentrator 带聚光器的高效inxga1 - xn基多结光伏电池
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375364
R. Islam, T. Hasan, M. Rayhan, A. G. Bhuiyan
{"title":"High Efficiency InxGa1-xN-Based Multi-Junction Photo Voltaic Cells with Concentrator","authors":"R. Islam, T. Hasan, M. Rayhan, A. G. Bhuiyan","doi":"10.1109/ICICT.2007.375364","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375364","url":null,"abstract":"InxGa1-xN has been found to be very potential materials for the fabrication of high efficiency multi-junction (MJ) solar cells. The cost of MJ solar cells composing of III-V materials is higher than that of Si solar cells. To resolve the problem of cost is to employ concentrator systems, which concentrate sunlight with a lens, thereby increasing the intensity of sunlight striking the solar cells. A simulation model is developed which optimizes the design of MJ solar cells with concentrator for high efficiency. An efficiency of about 72.79% is achievable for eight junctions. Also the influence of temperature on efficiency is evaluated. The photocurrent density and open circuit voltage of each junction are calculated under AM 1.5 and it is assumed that each junction absorbs the solar photons that are not absorbed by the preceding one.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129698610","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信