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

2008 11th International Conference on Computer and Information Technology最新文献

筛选
英文 中文
Symbol timing estimation using near ML techniques and statistical performance evaluation for binary communications 使用近机器学习技术的符号时序估计和二进制通信的统计性能评估
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-25 DOI: 10.1109/ICCITECHN.2008.4802983
T. Hossain, S. Kandeepan
{"title":"Symbol timing estimation using near ML techniques and statistical performance evaluation for binary communications","authors":"T. Hossain, S. Kandeepan","doi":"10.1109/ICCITECHN.2008.4802983","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802983","url":null,"abstract":"In this paper, we analyze the performance of a non-data aided near maximum likelihood (NDA-NML) estimator for symbol timing recovery in binary digital communications. The analysis of the estimator is performed for an additive noise only channel and the simulation results are extended to a flat fading channel. The probability distribution of the timing estimates is derived, presented and compared with simulation results. The performance of the estimator is presented in terms of the bit error rate (BER) and the error variance of the estimates. The BER is computed when the estimator is operating under additive white Gaussian noise (AWGN) channel and Rayleigh fading channel. The variance of the estimates is computed for the noise only case and compared with the Cramer Rao bound (CRB) and modified Cramer Rao bound (MCRB).","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"286 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121371636","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
A Study of white matter and skull inhomogeneous anisotropic tissue conductivities on EEG forward head modeling 脑电头部正向建模中白质和颅骨非均匀各向异性组织电导率的研究
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-24 DOI: 10.1109/ICCITECHN.2008.4803103
M. R. Bashar, Yan Li, P. Wen
{"title":"A Study of white matter and skull inhomogeneous anisotropic tissue conductivities on EEG forward head modeling","authors":"M. R. Bashar, Yan Li, P. Wen","doi":"10.1109/ICCITECHN.2008.4803103","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803103","url":null,"abstract":"The aim of this study is to investigate the effects of white matter (WM) and skull inhomogeneous anisotropic tissue conductivities on human head modeling. The inhomogeneity of WM and skull is included using fractional anisotropy (FA) method and the anisotropy is included according to volume constraint in the head model construction. A five-layered spherical head model implemented using finite element method (FEM) is used as a volume conductor with a known current source to measure the electroencephalogram (EEG) on the head surface. Statistical measurement techniques are applied to analyze the EEGs obtained from inhomogeneous anisotropic head models and a homogeneous isotropic model. This study finds that the effects of WM and skull inhomogeneous anisotropy on EEG are significant.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126777505","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
Intelligent video surveillance for monitoring fall detection of elderly in home environments 智能视频监控，用于家庭环境中老年人的跌倒监测
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-17 DOI: 10.1109/ICCITECHN.2008.4803020
H. Foroughi, Baharak Shakeri Aski, H. Pourreza
{"title":"Intelligent video surveillance for monitoring fall detection of elderly in home environments","authors":"H. Foroughi, Baharak Shakeri Aski, H. Pourreza","doi":"10.1109/ICCITECHN.2008.4803020","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803020","url":null,"abstract":"Video surveillance is an omnipresent topic when it comes to enhancing security and safety in the intelligent home environments. In this paper, we propose a novel method to detect various posture-based events in a typical elderly monitoring application in a home surveillance scenario. These events include normal daily life activities, abnormal behaviors and unusual events. Due to the fact that falling and its physical-psychological consequences in the elderly are a major health hazard, we monitor human activities with a particular interest to the problem of fall detection. Combination of best-fit approximated ellipse around the human body, projection histograms of the segmented silhouette and temporal changes of head position, would provide a useful cue for detection of different behaviors. Extracted feature vectors are fed to a MLP neural network for precise classification of motions and determination of fall event. Reliable recognition rate of experimental results underlines satisfactory performance of our system.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129216783","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}
引用次数: 216
Performance of fast routing algorithm for Vertically Stacked Optical Banyan networks with link failures and given crosstalk constraint 具有链路失效和串扰约束的垂直堆叠光榕树网络的快速路由算法性能
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803039
B. Sultana, M. Khandker
{"title":"Performance of fast routing algorithm for Vertically Stacked Optical Banyan networks with link failures and given crosstalk constraint","authors":"B. Sultana, M. Khandker","doi":"10.1109/ICCITECHN.2008.4803039","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803039","url":null,"abstract":"For faster connection establishment, previously proposed Pruned Vertically Stacked Optical Banyan (P-VSOB) networks used plane fixed routing (PFR) algorithm, and has O(log2N) routing complexity. Blocking probability has also been analyzed for these kinds of networks with given amount of crosstalk. In EP-VSOB networks, a few regular banyan planes are added with the PVSOB networks. Necessary routing algorithm, namely, PFR_LS and PFR_RS show that this switching network can reduce the blocking probability to very low value while keeping the hardware cost almost the same as that of PVSOB networks. Both these algorithm also have the time complexity O(log2N). This paper deals with the blocking behavior of EP-VSOB (Extended pruned VSOB) networks having link-failures and allows crosstalk constraint. Our simulation results show that crosstalk adds a new dimension to the performance analysis of practical EP-VSOB networks where some links are failed. The results show that if we allow some CSEs to the network then blocking probability decreases to low value for both PFR_LS and PFR_RS algorithm. The results also show that the blocking probability of the EP-VSOB networks does not always increase with the increase of link-failures; blocking probability decreases for certain range of link-failures, and then increases again.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115125443","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 combined local-global optical flow approach for cranial ultrasonogram image sequence analysis 局部-全局联合光流方法在颅超声图像序列分析中的应用
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803041
M. Ahmad, T. Taslima, L. Lata, M. Yamada
{"title":"A combined local-global optical flow approach for cranial ultrasonogram image sequence analysis","authors":"M. Ahmad, T. Taslima, L. Lata, M. Yamada","doi":"10.1109/ICCITECHN.2008.4803041","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803041","url":null,"abstract":"Tissue-motions can represent the strength of artery pulsation of a newborn baby for pediatrics diagnosis. In this paper, we propose a novel method to estimate the tissue-motion quantitatively by combining local and global motion estimation methods, namely combined local-global (CLG) optical flow technique in cranial ultrasonogram of newborn babies. Tissue motions are estimated in different coronal sections successfully. Further, we analyze the time variant tissue-motion by using discrete Fourier transform. We also observed the pulsation in the time variant motion images and strong pulsation is observed in the harmonic frequency of tissue-motion that has a relation to the heartbeat frequency of a newborn baby.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125774315","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
Routing algorithm for vertically stacked optical banyan networks with the time complexity O(N) using pipelined processors 基于流水线处理器的时间复杂度为O(N)的垂直堆叠光榕树网络路由算法
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803016
M. Khandker
{"title":"Routing algorithm for vertically stacked optical banyan networks with the time complexity O(N) using pipelined processors","authors":"M. Khandker","doi":"10.1109/ICCITECHN.2008.4803016","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803016","url":null,"abstract":"Centralized control routing algorithm for optical banyan networks on vertical stacking scheme has time complexity O(Nlog2N) for rearrangebly nonblocking structure. A distributed algorithm with O(log2N) has been recently proposed in which authors have considered an N completely connected processors to take routing decision which practically would be very difficult to implement for large N. In this paper we have proposed a distributed routing algorithm with processors work in pipelined fashion and take the routing decision in linear time. Also they do not need to be completely connected which makes it more practical for implementation.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"305 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116456949","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
Lightpath reconfigurations in IP-over-CWDM networks with stackable ROADMs 具有可堆叠roadm的IP-over-CWDM网络中的光路重新配置
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803084
M. Nooruzzaman, Y. Harada, M. Hashimoto, O. Koyama, Y. Katsuyama
{"title":"Lightpath reconfigurations in IP-over-CWDM networks with stackable ROADMs","authors":"M. Nooruzzaman, Y. Harada, M. Hashimoto, O. Koyama, Y. Katsuyama","doi":"10.1109/ICCITECHN.2008.4803084","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803084","url":null,"abstract":"Stackable ROADMs (S-ROADMs) have been proposed for use in regional IP-over-CWDM networks. The S-ROADM can be constructed by connecting modules with different wavelengths required in the node. The experimental results clarified that the S-ROADM could mux and demux the wavelengths successfully, and gave no limit to the passing-through wavelengths, making the network be wavelength transparent. Contrary to the S-ROADM, the existing fixed ROADMs were not wavelength transparent. The bidirectional S-ROADMs have also been proposed, and lightpaths could be reconfigured successfully in an IP-over-CWDM network with the bidirectional S-ROADMs.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122660264","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
Two-Level Dictionary-Based Text Compression Scheme 基于两级字典的文本压缩方案
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803026
Z.K. Zia, D.F. Rahman, C.M. Rahman
{"title":"Two-Level Dictionary-Based Text Compression Scheme","authors":"Z.K. Zia, D.F. Rahman, C.M. Rahman","doi":"10.1109/ICCITECHN.2008.4803026","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803026","url":null,"abstract":"In this paper a new dictionary and memory based text compression technique is presented called a two-level dictionary based text compression scheme. The original words in a text file are transformed into codewords having length 2 and 3 using a dictionary comprising 73680 frequently used words in English language. Among these words most frequently used words use 2 length codewords and the rest use 3 length codewords for better compression. The codewords are chosen in such way that the spaces between words in the original text file can be removed altogether recovering a substantial amount of space. Another unique feature of our compression scheme is that we have recovered unused bit of ASCII character representation from each character to save one byte per 8 ASCII characters. Lastly a back end existing compression algorithm is used to finally compress the file. We have achieved about 75% (compression ratio of 2.01 bits per input character) reduction in size using our new compression strategy with gzip and bzip2.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114150518","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}
引用次数: 11
An empirical framework for translating of Phrasal verbs of English sentence into Bangla 英语句子动词短语翻译成孟加拉语的经验框架
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803057
M. M. Hoque, M.M. Ahamad, M. S. Arefin, M. Monjur-Ul-Hasan, M. Hossain
{"title":"An empirical framework for translating of Phrasal verbs of English sentence into Bangla","authors":"M. M. Hoque, M.M. Ahamad, M. S. Arefin, M. Monjur-Ul-Hasan, M. Hossain","doi":"10.1109/ICCITECHN.2008.4803057","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803057","url":null,"abstract":"Generally phrasal verbs comprise a verb followed by a preposition that is commonly occurring feature in English. Each of the phrasal verbs acquires absolutely different meanings in different contexts. Having highly context dependent meanings, phrasal verbs may be disambiguated only by devising a technique involving utilization of semantic information pertaining to the context. This paper presented a framework for translating the phrasal verbs in English sentence into its equivalent Bangla. Semantics is necessary in the field of natural language processing to detect the meaning of the individual words in the sentence. This paper also describes different types of semantic features that perform semantic based disambiguation of phrasal verbs. A translation engine works to find out the exact Bangla meaning of the phrasal verb from different English sentences. We have tested our model for different type of English sentences containing phrasal verbs that are taken from the English newspaper and English textbook. We got successful results for most of the test cases.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128424901","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
Generation of mountain ranges by modifying a controlled terrain generation approach 通过修改受控地形生成方法生成山脉
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803058
K. R. Kamal, M. Kaykobad
{"title":"Generation of mountain ranges by modifying a controlled terrain generation approach","authors":"K. R. Kamal, M. Kaykobad","doi":"10.1109/ICCITECHN.2008.4803058","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803058","url":null,"abstract":"The terrain generation approach proposed in dasiaParametrically controlled terrain generation, (Proceedings of GRAPHITE 2007)psila focuses on generation of terrains having mountains of prespecified heights and spreads of base regions and peaks nearly at prespecified locations. However, inability to produce mountain ranges is a shortcoming of the algorithm. In this paper, we present a modification to the original algorithm that will enable generation of whole mountain ranges while preserving the similar parametric control over the resulting terrain. Experimental results of our algorithm have also been compared with results of existing algorithms.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129275829","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
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信