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

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

筛选
英文 中文
Codebook design method for speaker identification based on Genetic Algorithm 基于遗传算法的说话人识别码本设计方法
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803002
M.R. Islam, M.F. Rahman, M. Amin, M. Zaman
{"title":"Codebook design method for speaker identification based on Genetic Algorithm","authors":"M.R. Islam, M.F. Rahman, M. Amin, M. Zaman","doi":"10.1109/ICCITECHN.2008.4803002","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803002","url":null,"abstract":"In this paper, a novel method of designing a codebook for speaker identification purpose utilizing genetic algorithm has been proposed. Speech features have been extracted using standard speech parameterization method such as LPC, LPCC, RCC, MFCC, DeltaMFCC and DeltaDeltaMFCC. For each of these techniques, the performance of the proposed system has been compared. In this codebook design method, genetic algorithm has the capability of getting global optimal result and hence improves the quality of the codebook. Experimental results show the superiority (i.e. 92% accuracy has been achieved) of this proposed codebook design method.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"25 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":"124935935","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 analysis on an efficient human motion database with various motion representations 具有多种运动表示的高效人体运动数据库的性能分析
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803096
S. Eftakhar, J. Tan, Hyoungseop Kim, S. Ishikawa
{"title":"Performance analysis on an efficient human motion database with various motion representations","authors":"S. Eftakhar, J. Tan, Hyoungseop Kim, S. Ishikawa","doi":"10.1109/ICCITECHN.2008.4803096","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803096","url":null,"abstract":"In this paper, our proposed structured human motion database is adopted for different motion representations. The motions are first represented as a sequence of frames of 2D images, which were compressed using three recognized motion representation techniques: exclusive-OR, MEI (motion energy image), and MHI (motion history images). The representation is a 2D feature image. The feature image is compressed by characterizing the eigenvectors. A complete vector space called an eigenspace is constructed that represents the image feature vectors for the feature image. The motions are indexed using the projections onto the eigenspace. For the purpose of efficient searching within the database, our proposed B-tree motion database is created and maintained. The comparative performance evaluations for the aforesaid representations were investigated and satisfactory performances (about 90% recognition rate and smaller searching time) were realized for all of the cases using our proposed motion database structure.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"15 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":"129164301","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
Evaluation of TCP performance over mobile IP wired-cum-wireless networks 移动IP有线和无线网络上TCP性能的评估
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803100
M.A. Nashiry, M. Abdullah-Al-Mahmud, M.M. Rahman, M. N. Anjum
{"title":"Evaluation of TCP performance over mobile IP wired-cum-wireless networks","authors":"M.A. Nashiry, M. Abdullah-Al-Mahmud, M.M. Rahman, M. N. Anjum","doi":"10.1109/ICCITECHN.2008.4803100","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803100","url":null,"abstract":"Mobility of user devices connecting to the Internet is of major interest in today's research in networking. For users as well as for applications, network mobility should be transparent. Reliable transport protocols like TCP has served well the wired Internet where the packet losses are mainly due to congestion, but is not ready for mobile IP wired-cum-wireless environments where the significant packet losses are due to bit errors and handoffs. In this paper, we have investigated the performance of TCP among the various TCP variants. We have observed both TCP senders (Newreno & Vegas) and TCP receivers (Base & Delayed-Ack). Using ns-2, we have evaluated the TCP throughput and packet delay over a single TCP connection. The simulation results suggest that a particular combination (one TCP sender with one TCP receiver) of TCP shows the best result in such mobile IP networks.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"6 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":"125264825","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
High-speed distance measurement between moving vehicles with NIR-LED markers 用NIR-LED标记器测量移动车辆之间的高速距离
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803048
M. Fukuzawa, H. Hama, N. Nakamori, M. Yamada
{"title":"High-speed distance measurement between moving vehicles with NIR-LED markers","authors":"M. Fukuzawa, H. Hama, N. Nakamori, M. Yamada","doi":"10.1109/ICCITECHN.2008.4803048","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803048","url":null,"abstract":"An image-based technique with high measurement rate has been proposed to measure the distance between two moving vehicles. By combining several near-infrared (NIR) LED markers mounted on the forward vehicle with an NIR-filtered CMOS camera mounted on the backward vehicle, one can clearly recognize the marker shape and positions without any adjusting the focus lens of camera, and hence he can extremely reduce the time of digital preprocessing such as noise elimination and marker segmentation. The distance may be easily calculated from the geometrical transformation of the marker positions obtained in sub-pixel resolution from the gravity center of the pixel value. The image-based technique proposed here is actually examined in the vehicles moving on linear and curved tracks. It is experimentally confirmed that the measurement rate attains to 1000 frames/sec in the windowed image of 752 times 34 pixels, with a small processor with the clock of 600 MHz, including the capture time of the image, the calculation time of the gravity center, and the geometrical transformation time. The measurement error is less than 1 % for the distance range of 0.5 to 3 m.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"20 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":"125374559","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
Design and implementation of microprocessor based electronic voting system 基于微处理器的电子投票系统的设计与实现
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803028
M.R. Alam, M. Masum, M. Rahman, A. Rahman
{"title":"Design and implementation of microprocessor based electronic voting system","authors":"M.R. Alam, M. Masum, M. Rahman, A. Rahman","doi":"10.1109/ICCITECHN.2008.4803028","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803028","url":null,"abstract":"In this paper, we described the design and hardware implementation of an electronic voting machine. The main aim of this project is not to design a power efficient perfect device but is to design a mother device that can be adoptable to any recent technologies. The design of the machine and its usage is as simple as an illiterate common people can easily use it. A vote casting procedure is also proposed to use the machine where we prescribed a new procedure called DEMO vote casting which is a testing mechanism to test the device before vote casting and also at the run time. The vote casting system is almost similar to traditional system, only ballot box will be replaced by the device. The machine uses voter ID to identify a valid voter and restrict multiple vote casting.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"13 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":"130263083","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}
引用次数: 16
A history based semantic aware access control model using logical time 使用逻辑时间的基于历史的语义感知访问控制模型
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803125
A. Ravari, M. Amini, R. Jalili, J. H. Jafarian
{"title":"A history based semantic aware access control model using logical time","authors":"A. Ravari, M. Amini, R. Jalili, J. H. Jafarian","doi":"10.1109/ICCITECHN.2008.4803125","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803125","url":null,"abstract":"With the advent of semantic technology, access control cannot be done in a safe way unless the access decision takes into account the semantic relationships among the entities in a semantic-aware environment. The SBAC model (semantic based access control model) considers this issue in its decision making process. However, time plays a crucial role in new computing environments, which is not supported in SBAC. In this paper, we propose the temporal semantic based access control (TSBAC) model, as an extension of SBAC, which enhances the specification of user-defined authorization rules by constraining time interval and temporal expression over users' history of accesses. TSBAC uses logical time, rather than to real time, in its authorization rules. A formal semantics for temporal authorizations is provided and conflicting situations (due to the semantic relations of the SBAC model and a sub-interval relation between authorizations) are investigated and resolved in our proposed model. An architecture for the access control system based on TSBAC is presented.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"44 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":"127915500","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
Selecting signature optical emission spectroscopy variables using sparse principal component analysis 稀疏主成分分析选择特征发射光谱变量
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803104
Beibei Ma, S. McLoone, J. Ringwood, N. MacGearailt
{"title":"Selecting signature optical emission spectroscopy variables using sparse principal component analysis","authors":"Beibei Ma, S. McLoone, J. Ringwood, N. MacGearailt","doi":"10.1109/ICCITECHN.2008.4803104","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803104","url":null,"abstract":"Principal component analysis (PCA) is a widely used technique in optical emission spectroscopy (OES) sensor data analysis for the low dimension representation of high dimensional datasets. While PCA produces a linear combination of all the variables in each loading, sparse principal component analysis (SPCA) focuses on using a subset of variables in each loading. Therefore, SPCA can be used as a key variable selection technique. This paper shows that, using SPCA to analyze 2046 variable OES data sets, the number of selected variables can be traded off against variance explained to identifying a subset of key wavelengths, with an acceptable level of variance explained. SPCA-related issues such as selection of the tuning parameter and the grouping effect are discussed.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"300 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":"122742065","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}
引用次数: 2
An improved keyword extraction method using graph based random walk model 一种改进的基于图的随机游走模型的关键词提取方法
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4802967
M. Islam
{"title":"An improved keyword extraction method using graph based random walk model","authors":"M. Islam","doi":"10.1109/ICCITECHN.2008.4802967","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802967","url":null,"abstract":"Keywords can be considered as condensed versions of documents, which can play important role in some text processing tasks such as text indexing, summarization and categorization. However, there are many digital documents especially on the Internet that do not have a list of assigned keywords. Assigning keywords to these documents manually is a difficult task and requires appropriate knowledge of the topic. Automatic keyword extraction process can solve this problem. In this paper, we introduce a new improved method for keyword extraction using random walk model by considering position of terms within the document and information gain of terms corresponds to the whole set of documents. We also incorporate mutual information (MI) of terms with random walk model to extract keywords from documents. The experiments on standard test collections show that our method outperforms the previously proposed methods.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"12 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":"116438717","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
Significant cancer risk factor extraction: An association rule discovery approach 重要癌症风险因子提取:一种关联规则发现方法
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803102
J. Nahar, K. Tickle
{"title":"Significant cancer risk factor extraction: An association rule discovery approach","authors":"J. Nahar, K. Tickle","doi":"10.1109/ICCITECHN.2008.4803102","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803102","url":null,"abstract":"Cancer is the top most death threat for human life all over the world. Current research in the cancer area is still struggling to provide better support to a cancer patient. In this research our aim is to identify the significant risk factors for particular types of cancer. First, we constructed a risk factor data set through an extensive literature review of bladder, breast, cervical, lung, prostate and skin cancer. We further employed three association rule mining algorithms, apriori, predictive apriori and Tertius algorithm in order to discover most significant risk factors for particular types of cancer. Discovery risk factor has been identified to shows highest confidence values. We concluded that apriori indicates to be the best association rule-mining algorithm for significant risk factor discovery.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"101 6 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":"125719412","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}
引用次数: 7
A data hiding capacity estimation technique for biometric images 生物特征图像的数据隐藏容量估计技术
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803097
G. Sarbishei, S. H. Khayat
{"title":"A data hiding capacity estimation technique for biometric images","authors":"G. Sarbishei, S. H. Khayat","doi":"10.1109/ICCITECHN.2008.4803097","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803097","url":null,"abstract":"In this paper an estimation technique for the data hiding capacity in biometric images is presented. We consider the QSWT algorithm for data hiding in biometric images and investigate the effect of message strength in increasing capacity in the presence of different types of attacks.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"45 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":"126948257","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学术文献互助群
群 号：481959085
Book学术官方微信