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

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

筛选
英文 中文
LCRACO - A new load and congestion controlled routing based on ant colony optimization LCRACO -一种新的基于蚁群优化的负载和拥塞控制路由
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803129
R. Chaki, D. Sinha
{"title":"LCRACO - A new load and congestion controlled routing based on ant colony optimization","authors":"R. Chaki, D. Sinha","doi":"10.1109/ICCITECHN.2008.4803129","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803129","url":null,"abstract":"Designing efficient, cost-effective routing solutions for the infrastructure-less MANETs remains a daunting task till date. A proven optimization technique, the Ant colony optimization has been used in this paper to find the optimum in terms of the shortest route in a MANET. Special attention has been given to the load balancing and congestion control in the network. The simulated performance graphs show an improved congestion control for the proposed routing protocol.","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":"124225687","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
Comparative performance analysis of DSR and AODV protocol based on mobility factor 基于移动系数的DSR和AODV协议性能比较分析
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803055
A. Mahmood, M.S. Hossain, F. Aziz
{"title":"Comparative performance analysis of DSR and AODV protocol based on mobility factor","authors":"A. Mahmood, M.S. Hossain, F. Aziz","doi":"10.1109/ICCITECHN.2008.4803055","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803055","url":null,"abstract":"Ad hoc wireless networks are decentralized in nature and hence routing is a central challenge in this type of network. In this paper we describe a simulation model to simulate the routing protocols for wireless ad hoc networks and analyze the results from the simulation for performance evaluation. The simulation model incorporates the number of parameter values with changing environmental factors. Specially we have chosen the dynamic source routing (DSR) and ad-hoc on demand distance vector routing (AODV) protocol to be implemented in the simulation software with that model. We carried out the extensive simulations and we conclude with the comparative statistical analysis of those two protocols based on mobility factor.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"48 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":"124956739","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
Extended algorithm for spatial characterization and discrimination rules 空间表征和判别规则的扩展算法
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803013
R. Hasan, Z. Hossain, F.M. Chowdhury, M. Hasan
{"title":"Extended algorithm for spatial characterization and discrimination rules","authors":"R. Hasan, Z. Hossain, F.M. Chowdhury, M. Hasan","doi":"10.1109/ICCITECHN.2008.4803013","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803013","url":null,"abstract":"Spatial data mining, i.e., mining knowledge from large amounts of spatial data, is a demanding field since huge amounts of spatial data have been collected in various applications, ranging from remote sensing to geographical information systems (GIS), computer cartography, environmental assessment and planning. The collected data far exceed people's ability to analyze it. The number and the size of spatial databases are rapidly growing which results in an increasing need for spatial data mining. In this paper, we have presented a new spatial data mining algorithm for spatial characterization and discrimination rules. For spatial data mining algorithm, it is important that class membership of a database object is not only determined by its non-spatial attributes but also by the attributes of objects in its neighborhood. We have implemented the algorithm within a general framework for spatial data mining providing a small set of database primitives on top of a commercial spatial database management system. At the end, performance analysis using a real geographic database demonstrates the effectiveness of the proposed algorithms.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"29 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":"122163876","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
Low-cost realization of toffoli gate for the low-cost synthesis of quantum ternary logic functions 低成本实现toffoli门，用于低成本合成量子三元逻辑函数
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803024
Md. Mehedi Hasan
{"title":"Low-cost realization of toffoli gate for the low-cost synthesis of quantum ternary logic functions","authors":"Md. Mehedi Hasan","doi":"10.1109/ICCITECHN.2008.4803024","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803024","url":null,"abstract":"Reversible quantum computer system is one of the best choices for future computer systems. Multiple-valued logic especially ternary logic is a good candidate for the realization of reversible quantum computer. An efficient logic synthesis mechanism is essential for the low-cost realization. Toffoli gate is an important gate for quantum logic synthesis. It is the basic element for the Galois Field Sum of Product (GFSOP) expression based logic synthesis mechanism. So, for low-cost realization of any ternary logic function, a low-cost implementation of Toffoli gate is very necessary. This paper shows a low-cost, practically realizable, and efficient realization of 3-qutrit ternary Toffoli gate by using ion-trap realizable Muthukrishnan-Stroud gate. This realization is more efficient and less costly than other realizations.","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":"130492643","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
Rice disease identification using pattern recognition techniques 利用模式识别技术鉴定水稻病害
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803079
S. Phadikar, J. Sil
{"title":"Rice disease identification using pattern recognition techniques","authors":"S. Phadikar, J. Sil","doi":"10.1109/ICCITECHN.2008.4803079","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803079","url":null,"abstract":"The techniques of machine vision are extensively applied to agricultural science, and it has great perspective especially in the plant protection field, which ultimately leads to crops management. The paper describes a software prototype system for rice disease detection based on the infected images of various rice plants. Images of the infected rice plants are captured by digital camera and processed using image growing, image segmentation techniques to detect infected parts of the plants. Then the infected part of the leaf has been used for the classification purpose using neural network. The methods evolved in this system are both image processing and soft computing technique applied on number of diseased rice plants.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"4 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":"125703408","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}
引用次数: 302
Comparison of GARCH and neural network methods in financial time series prediction GARCH与神经网络方法在金融时间序列预测中的比较
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803094
A. Hossain, M. Nasser
{"title":"Comparison of GARCH and neural network methods in financial time series prediction","authors":"A. Hossain, M. Nasser","doi":"10.1109/ICCITECHN.2008.4803094","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803094","url":null,"abstract":"Many researchers have already published huge number of papers comparing Autoregressive (AR) model, a model based on Box-Jenkins methodology, and Back Propagation Artificial Neural Network (BPANN) in financial time-series forecasting. Among them, some compared SVMs and BPs taking AR as a benchmark in forecasting the six major Asian stock markets. They showed that both the SVMs and BPs outperform the traditional models, ARs. They did prediction of transformed data, but not level data. They did not take account of GARCH model, specially developed to model financial time series. Generalized Autoregressive Conditional Heteroskedastic (GARCH) model is needed to capture high volatility for better forecasts. This article applies GARCH model instead AR or ARMA model to compare with standard BP in forecasting of the four international including two Asian stock markets indices. Our fitted GARCH models give better forecasts than the fitted standard BP models in forecasting of the four international markets indices except one market.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"50 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":"114993330","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
A New Proposal for Choosing a Deflection Link in a Deflection Network 偏转网络中偏转链路选择的新方案
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803066
M.A. Rahman, M. Hossain, S. Anwar
{"title":"A New Proposal for Choosing a Deflection Link in a Deflection Network","authors":"M.A. Rahman, M. Hossain, S. Anwar","doi":"10.1109/ICCITECHN.2008.4803066","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803066","url":null,"abstract":"In high-speed networks with greater connectivity, packets can be deflected through a sub-optimal path to reach the destination if the desired path is congested, failed or the buffer is full. However, in a combined store-and-forward and deflection network, packets are deflected when there is congestion in the network. For choosing a link for deflection in such a combined network, currently existing strategy considers only local information to the node in need to deflect a packet. In this paper, a new proposal has been introduced to select an outgoing link for deflection. Under the proposed strategy, packets are guaranteed to traverse through the best cost path available to the destination when they are deflected. Simulation shows better results than that of the existing strategy in terms of packet delivery, discard and average cost per delivered packet.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"32 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":"114783655","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 distributed evolutionary computation technique for solving large number of equations 一种新的求解大量方程的分布式进化计算技术
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4802989
M. Jahan, M. Hashem, G.A. Shahriar
{"title":"A new distributed evolutionary computation technique for solving large number of equations","authors":"M. Jahan, M. Hashem, G.A. Shahriar","doi":"10.1109/ICCITECHN.2008.4802989","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802989","url":null,"abstract":"Evolutionary algorithm is more effective to gain optimal solution to solve equations than traditional methods. It also provides quick solution for solving large number of equations having huge parameters with less expense in distributed manner. This paper presents a new distributed evolutionary computation technique, which decomposes decision vectors into smaller components and achieves optimal solution in short time. In this technique, A Jacobi-based Time Variant Adaptive (JBTVA) Hybrid Evolutionary Algorithm is distributed. Moreover, a new selection method named Best All Selection (BAS) is introduced for selecting best individuals. Experimental results show that optimal solution is achieved for different kinds of problems having huge parameters and considerably speedup is formed in proposed distributed system.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"22 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":"133859104","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
Secure online sealed bid Auction 安全在线密封竞标拍卖
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803092
N. Islam, M.Z. Rahman
{"title":"Secure online sealed bid Auction","authors":"N. Islam, M.Z. Rahman","doi":"10.1109/ICCITECHN.2008.4803092","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803092","url":null,"abstract":"Security and privacy have become crucial factors in auction design. Various schemes to ensure the safe conduction of sealed bid auctions have been proposed recently. We propose a secure sealed bid auction protocol. We introduce a new standard of privacy for auctions, that prevents extraction of bid information despite any collusion of participants. Present cryptographic protocol which is the realization of an electronic auction being the component of the e-government or e-commerce system. Our protocol provide non-reputation and correctness.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"50 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":"121853511","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
QoS based Fair Load-Balancing: Paradigm to IANRA Routing Algorithm for Wireless Networks (WNs) 基于QoS的公平负载均衡:无线网络IANRA路由算法范式
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803001
Ayyoub Akbari Moghanjoughi, Sabira Khatun, Borhanuddin Mohd. Ali, R. Abdullah
{"title":"QoS based Fair Load-Balancing: Paradigm to IANRA Routing Algorithm for Wireless Networks (WNs)","authors":"Ayyoub Akbari Moghanjoughi, Sabira Khatun, Borhanuddin Mohd. Ali, R. Abdullah","doi":"10.1109/ICCITECHN.2008.4803001","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803001","url":null,"abstract":"In this paper, a new algorithm, intelligent agent antnet based routing algorithm (IANRA) is proposed to enhance load balancing strategy in wireless networks (WNs). IANRA is based on ants behaviour with some important factors such as: the specific self-organizing behaviour of ant colonies, the shortest path discovery and the related framework of ant colony optimization (ACO). The main focus in IANRA is to find optimum and near optimum route by means of genetic algorithm (GA) using breeding capability of ants. Here, ants can produce a number of generations with the target to discover an optimized route. Hence IANRA is able to prevent of the difficulties which exist in existing routing algorithms, such as ad hoc on-demand distance vector (AODV), AntNet etc. The obtained results show that the efficiency of IANRA algorithm is better than AODV and AntNet or any other related algorithm. In addition, the proposed algorithm (IANRA) is able to reduce the end-to-end delay and increase the packet delivery ratio significantly.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"26 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":"126137658","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
首页 上一页 下一页 尾页
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学术官方微信