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

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

筛选
英文 中文
Mathematical Representation and Analysis of Rhythms from Various Regions 不同地区节奏的数学表现与分析
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375333
M.T. lrfan, M. Akhtaruzzaman, S. Islam, M. Alam
{"title":"Mathematical Representation and Analysis of Rhythms from Various Regions","authors":"M.T. lrfan, M. Akhtaruzzaman, S. Islam, M. Alam","doi":"10.1109/ICICT.2007.375333","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375333","url":null,"abstract":"Rhythm is one of the fundamental elements of music. Each piece of music follows a rhythm. It might be observed that music of various regions differ from each other. A basic question is-what are the underlying properties of music that cause this difference? In this paper, first we study mathematical representation of rhythms of various regions. And then we analyze these representations with a view to building a classification system that can categorize rhythms of various regions. Here we use basically the same mathematical representation given by Toussaint [3, 4]. Toussaint has also shown a way to classify African, Brazilian and Cuban rhythms based on various distance matrices. In this paper, apart from these rhythms, we also study North Indian rhythms, used in India and Bangladesh and use turning function [1], a function for polygon similarity measurement, to find out distance measures among various rhythms. Finally, we use various types of phylogenetic trees to build up a graphical classification system.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"124 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":"122482599","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
A Hybrid Approach to Pattern Recognition of A Nonstationary Signal Using Variable Window STFT and Complex Kalman Filter 基于变窗STFT和复卡尔曼滤波的非平稳信号混合模式识别方法
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375393
B. Biswal, P. Dash, G. Panda, P. Tripathy
{"title":"A Hybrid Approach to Pattern Recognition of A Nonstationary Signal Using Variable Window STFT and Complex Kalman Filter","authors":"B. Biswal, P. Dash, G. Panda, P. Tripathy","doi":"10.1109/ICICT.2007.375393","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375393","url":null,"abstract":"This paper presents a variable window short-time Fourier transform (STFT) and an extended complex Kalman filter (CEKF). The technique is applied to both simulated and experimentally obtained waveform disturbances in the presence of additive noise and the results reveal significant accuracy in completely localizing the changes in amplitude, frequency, and phase of nonstationary sinusoids in noise.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"5 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":"122815468","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}
引用次数: 1
Performance Limitations of A Subcarrier Multiplexed Optical Transmission System Due to Optical Beat Interference 一种子载波复用光传输系统在光拍干扰下的性能限制
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375380
S. Bhowmick, T. Khaleque, S. Reza, S. Majumder
{"title":"Performance Limitations of A Subcarrier Multiplexed Optical Transmission System Due to Optical Beat Interference","authors":"S. Bhowmick, T. Khaleque, S. Reza, S. Majumder","doi":"10.1109/ICICT.2007.375380","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375380","url":null,"abstract":"A theoretical performance analysis is presented for a subcarrier multiplexed (SCM) optical transmission system in presence of optical beat interference (OBI) which occurs during the photodetection process for non-return to zero (NRZ) and delay modulation (DM) linecoding. A suitable bandwidth of 890-950 MHz is selected and channel bandwidth of 200 KHz and carrier separation of 250 KHz is considered. Results are evaluated in terms of signal to OBI ratio for the two linecoding schemes. It is found that there is a significant increase in the SIR and hence the number of subcarriers can be achieved by employing Miller code compared to NRZ for the same data rate. For example, for a number of subcarriers of 10, the achievable SIR is about 36 for Miller coded system compared to 10 dB for NRZ coded system.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"3 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":"128467558","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}
引用次数: 1
Channel-Spacing Tunable and Multiwavelength Switchable Erbium-Doped Fiber Laser 通道间距可调谐和多波长可切换掺铒光纤激光器
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375368
F. Ahmed, N. Kishi, T. Miki, M. G. Mostafa, A. Kafi
{"title":"Channel-Spacing Tunable and Multiwavelength Switchable Erbium-Doped Fiber Laser","authors":"F. Ahmed, N. Kishi, T. Miki, M. G. Mostafa, A. Kafi","doi":"10.1109/ICICT.2007.375368","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375368","url":null,"abstract":"Channel-spacing tunable and multi-wavelength switchable EDFL based on a single-segmented PMF Lyot-Sagnac filter and phase modulator is presented. The tuning and switching are performed by means of a polarizer and PC, respectively; those are incorporated in the filter.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"36 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":"114662389","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}
引用次数: 1
Simulation Technique & Application of Space-Vector PWM Method in PSCAD/EMTDC 空间矢量PWM方法在PSCAD/EMTDC中的仿真技术及应用
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375330
S. Muyeen, M. Mannan, M.H. Ali, R. Takahashi, T. Murata, J. Tamura
{"title":"Simulation Technique & Application of Space-Vector PWM Method in PSCAD/EMTDC","authors":"S. Muyeen, M. Mannan, M.H. Ali, R. Takahashi, T. Murata, J. Tamura","doi":"10.1109/ICICT.2007.375330","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375330","url":null,"abstract":"In this paper, the modeling and simulation process of space vector pulse width modulation (SVPWM) technique is presented using PSCAD/EMTDC because it has so far still not been reported for PSCAD user base. To demonstrate the implementation of SVPWM technique the well-known voltage source converter (VSC) based STATCOM is chosen. Both of the steady state and the transient performance of the wind generator is presented, which validates the effectiveness of the simulation process of SVPWM. The PSCAD community can easily apply the SVPWM simulation technique in other application.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"37 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":"114783682","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}
引用次数: 15
On-Line Algorithms for Vertex-Rankings of Graphs 图顶点排序的在线算法
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375335
M.R. Rahman, E. Haque, M. Islam, A. Kashem
{"title":"On-Line Algorithms for Vertex-Rankings of Graphs","authors":"M.R. Rahman, E. Haque, M. Islam, A. Kashem","doi":"10.1109/ICICT.2007.375335","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375335","url":null,"abstract":"A vertex-ranking of a graph G is a labeling of the vertices of G such that every path between two vertices with the same label gamma contains a vertex with label lambda > gamma. In any on-line vertex-ranking algorithm, the vertices arrive one at a time in any order and only the local information in the vertices of the induced subgraph G[{nu1.....nui}] is available when the algorithm must choose a rank for Vi. The best known online algorithm for vertex-ranking a tree takes O(n3) time, where n is the number of vertices in the tree. In this paper we present an O(n2) time on-line algorithm for ranking the vertices of a tree. We also derive an upper bound on the number of ranks used by the algorithm for an important sub-class of trees, namely complete t-ary trees. Finally we provide an on-line vertex ranking algorithm for simple graphs by extending the on-line tree ranking algorithm.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"44 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":"114819082","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}
引用次数: 4
Multiple Disjoint Power Aware Minimum Connected Dominating Sets for Efficient Routing in Wireless Ad Hoc Network 无线自组网中多不相交功率感知最小连接控制集的高效路由
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375406
T. Acharya, S. Chattopadhyay, R. Roy
{"title":"Multiple Disjoint Power Aware Minimum Connected Dominating Sets for Efficient Routing in Wireless Ad Hoc Network","authors":"T. Acharya, S. Chattopadhyay, R. Roy","doi":"10.1109/ICICT.2007.375406","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375406","url":null,"abstract":"Dominating set based routing is emerging as a promising approach for routing in ad hoc wireless networks. A set is dominating if all the nodes in the network are either in the set or neighbors of nodes in the set. Power aware minimum connected dominating set refers to a minimum connected dominating set where energy levels of all dominator nodes are above a predefined threshold level. Usually, nodes in the connected dominating set consume more energy in order to handle various bypass traffics than nodes outside the set. If we want to prolong the life span of each node in the network by balancing their energy consumption, nodes should be alternated in being chosen to form a connected dominating set. With this objective, a distributed algorithm is presented to construct multiple node-disjoint power aware minimum connected dominating sets, based on our initial proposal for single power aware MCDS. Applying existing prominent multipath routing strategies on this multiple dominating set, we show that the new algorithm yields better results in terms of maximizing routing tasks, minimizing average energy consumption per packet, and enhancing lifetime of each node in the network.","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":"124111551","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}
引用次数: 13
A Matchmaking Algorithm for Resource Discovery on Grid 网格上资源发现的匹配算法
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375373
Rafiqul Islam, Md Zahidul Islam, Nazia Leyla
{"title":"A Matchmaking Algorithm for Resource Discovery on Grid","authors":"Rafiqul Islam, Md Zahidul Islam, Nazia Leyla","doi":"10.1109/ICICT.2007.375373","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375373","url":null,"abstract":"Resource management is a very important feature in the grid computing environment. The matchmaking framework [1] provides a reasonable solution to resource management in distributed environment; it is composed of four important components as classified advertisement (classad), matchmaker protocol, matchmaking algorithm and claiming protocols [2]. In this paper we proposed a fast and efficient searching method for matchmaking algorithm. The proposed algorithm reduces the searching time to a linear function from cubic function proposed in paper [2]. We discussed briefly the working principles of the method, its performance and its limitations.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"12 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":"129854474","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}
引用次数: 1
A density-periphery based graph clustering software developed for detection of protein complexes in interaction networks 一种基于密度外围的图聚类软件，用于相互作用网络中蛋白质复合物的检测
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375338
M. Altaf-Ul-Amin, H. Tsuji, K. Kurokawa, H. Ashahi, Y. Shinbo, S. Kanaya
{"title":"A density-periphery based graph clustering software developed for detection of protein complexes in interaction networks","authors":"M. Altaf-Ul-Amin, H. Tsuji, K. Kurokawa, H. Ashahi, Y. Shinbo, S. Kanaya","doi":"10.1109/ICICT.2007.375338","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375338","url":null,"abstract":"In this paper we present a graph clustering software called DPClus, which we have developed based on a clustering algorithm. The algorithm tends to isolate densely connected regions of a graph as clusters. Users have freedom to choose two input parameters within reasonable range and thus to affect the outcome of the clustering up to certain extent. Though this software can be used for graph clustering in general but it mainly focuses on detection of protein complexes in interaction networks. The proposed software makes it possible to detect and visualize clusters of proteins in interaction networks which mostly represent molecular biological functional units. We believe that the present software can be applied not only to other biological networks but also to networks in many other applications where finding cohesive group is an agenda.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"95 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":"127666630","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}
引用次数: 1
Modified Runlength Coding for Improved JPEG Performance 改进的运行长度编码，提高JPEG性能
2007 International Conference on Information and Communication Technology Pub Date : 2007-03-07 DOI: 10.1109/ICICT.2007.375383
A. Gupta, M.C. Srivastava, S.D. Pandey, V. Bhandari
{"title":"Modified Runlength Coding for Improved JPEG Performance","authors":"A. Gupta, M.C. Srivastava, S.D. Pandey, V. Bhandari","doi":"10.1109/ICICT.2007.375383","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375383","url":null,"abstract":"A number of image compression systems have been developed to save storage space and transmission bandwidth. The field of image compression has witnessed a lot of research on improving JPEG or evolving a codec with better performance. In the JPEG standard, run length encoding is used to code the string of zeros resulting from crude quantization of AC coefficients. In this paper we propose modified runlength JPEG (MR-JPEG), which uses separate coding of three symbols (RUNLENGTH, SIZE, AMPLITUDE) to code the information. To compare the results with the earlier scheme, we use two parameters-maximum difference (MD) for perceptual quality measurement and size (in KB's) for compression. Our results show that for large size images (512times512 and above), proposed scheme demonstrates higher compression with better quality.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"46 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":"127880967","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
首页 上一页 下一页 尾页
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学术官方微信